Extremal connected graphs for independent domination number

DOI10.1016/j.disc.2003.06.011zbMath1030.05085OpenAlexW1965478959MaRDI QIDQ1420609

Richard P. Vitray, Julie R. Carrington, Robert C. Brigham

Publication date: 2 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.06.011

zbMATH Keywords

DominationExtremalIndependent domination numberTotal matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Two relations between the parameters of independence and irredundance
• An upper bound for the independent domination number
• Parallel concepts in graph theory
• On the independent domination number of graphs with given minimum degree
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal connected graphs for independent domination number