Let G be a simple graph of order n and minimum degree delta. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. In this paper we show that i(G) less than or equal to n + 2 delta - 2 root n delta. Thus a conjecture of Favaron is settled ill the affirmative. (C) 1999 Academic Press.