ON MINIMUM MAXIMAL INDEPENDENT SETS OF A GRAPH

For a simple graph G, the independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. If G has order n and minimum degree delta less-than-or-equal-to n/2, we give upper bounds for i(G) as functions of n and delta, and over part of the range achieve best possible results. In particular, we extend work of Favaron (1988).