Extremal connected graphs for independent domination number
Abbreviated Journal Title
domination; independent domination number; total matching; extremal; IRREDUNDANCE; PARAMETERS; Mathematics
A general characterization of connected graphs on n vertices having the maximum possible independent domination number of [n + 2 - 2rootn] 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. (C) 2003 Published by Elsevier B.V.
"Extremal connected graphs for independent domination number" (2004). Faculty Bibliography 2000s. 4228.