Some inequalities about connected domination number

DOI10.1016/0012-365X(95)00088-EzbMath0859.05053MaRDI QIDQ1126207

Cheng Bo, Bo Lian Liu

Publication date: 7 April 1997

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

zbMATH Keywords

independence numberdomination numberirredundance number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Distance irredundance and connected domination numbers of a graph ⋮ Making a dominating set of a graph connected ⋮ Bounds on 2-point set domination number of a graph ⋮ On the Structure of Graphs Vertex Critical with Respect to Connected Domination ⋮ The bottleneck independent domination on the classes of bipartite graphs and block graphs. ⋮ On the doubly connected domination number of a graph ⋮ 2-edge connected dominating sets and 2-connected dominating sets of a graph ⋮ Connected Domination ⋮ Relating the size of a connected graph to its total and restricted domination numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on total domination
• Graph-theoretic parameters concerning domination, independence, and irredundance
• On Hadwiger's Number and the Stability Number
• Properties of Hereditary Hypergraphs and Middle Graphs