Title of article
Extremal connected graphs for independent domination number
Author/Authors
Robert C. Brigham، نويسنده , , Julie R. Carrington، نويسنده , , Richard P. Vitray، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
11
From page
299
To page
309
Abstract
A general characterization of connected graphs on n vertices having the maximum possible independent domination number of ⌊n+2−2n⌋ is given. This result leads to a structural characterization of such graphs in all but a small finite number of cases. For certain situations, one of which occurs when n is a perfect square, the extremal graphs have a particularly simple structure.
Keywords
Independent domination number , Total matching , extremal , Domination
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948746
Link To Document