On independent domination number of graphs with given
minimum degree
Authors: N. I. Glebov, A. V. Kostochka
ABSTRACT
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 by
J.~Haviland~\cite{H} and settles Case $\de =2$ of the
corresponding conjecture by O.~Favaron~\cite{F}.
DIMACS Home Page