Title
Extremal Connected Graphs For Independent Domination Number
Keywords
Domination; Extremal; Independent domination number; Total matching
Abstract
A general characterization of connected graphs on n vertices having the maximum possible independent domination number of ⌊n+2-2√n⌋ 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. © 2003 Published by Elsevier B.V.
Publication Date
1-28-2004
Publication Title
Discrete Mathematics
Volume
275
Issue
1-3
Number of Pages
299-309
Document Type
Article
Personal Identifier
scopus
DOI Link
https://doi.org/10.1016/j.disc.2003.06.011
Copyright Status
Unknown
Socpus ID
0346749328 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/0346749328
STARS Citation
Brigham, Robert C.; Carrington, Julie R.; and Vitray, Richard P., "Extremal Connected Graphs For Independent Domination Number" (2004). Scopus Export 2000s. 5312.
https://stars.library.ucf.edu/scopus2000/5312