The diversity of domination

DOI10.1016/0012-365X(95)00074-7zbMath0870.05034MaRDI QIDQ1356420

Henda C. Swart, Michael A. Henning, Ortrud R. Oellermann

Publication date: 15 September 1997

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

zbMATH Keywords

dominating setdomination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (9)

Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs ⋮ The ratio of the distance irredundance and domination numbers of a graph ⋮ Distance irredundance and connected domination numbers of a graph ⋮ Approximating the Spanning k-Tree Forest Problem ⋮ An algorithm to find two distance domination parameters in a graph ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM ⋮ An efficient algorithm for distance total domination in block graphs ⋮ Distance Domination in Graphs

Cites Work

• Bounds relating generalized domination parameters
• A note on total domination
• A linear algorithm for the domination number of a tree
• Graph-theoretic parameters concerning domination, independence, and irredundance
• On Complementary Graphs
• Bounds on a generalized domination parameter
• Total domination in graphs
• Dominating Sets in Chordal Graphs
• Towards a theory of domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The diversity of domination