On connected \(k\)-domination numbers of graphs.

DOI10.1016/S0012-365X(03)00203-6zbMath1035.05065MaRDI QIDQ1421532

Shougui Li

Publication date: 26 January 2004

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

zbMATH Keywords

Domination numberDomatic number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs ⋮ Distance irredundance and connected domination numbers of a graph ⋮ Connected Domination

Cites Work

• On $k$-domatic numbers of graphs
• The ratio of the distance irredundance and domination numbers of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On connected \(k\)-domination numbers of graphs.