Elsevier

Discrete Mathematics

Volume 275, Issues 1–3, 28 January 2004, Pages 299-309
Discrete Mathematics

Note
Extremal connected graphs for independent domination number

https://doi.org/10.1016/j.disc.2003.06.011Get rights and content
Under an Elsevier user license
open archive

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

Domination
Independent domination number
Total matching
Extremal

Cited by (0)