On the independent domination number of graphs with given minimum degree

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case δ = 2 of the corresponding conjecture by Favaron (1988).