Title of article
On the independent domination number of graphs with given minimum degree
Author/Authors
N.I. Glebov، نويسنده , , A.V. Kostochka، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
6
From page
261
To page
266
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 of Haviland (1991) and settles the case δ = 2 of the corresponding conjecture by Favaron (1988).
Journal title
Discrete Mathematics
Serial Year
1998
Journal title
Discrete Mathematics
Record number
951110
Link To Document