Distance irredundance and connected domination numbers of a graph

DOI10.1016/j.disc.2006.03.075zbMath1113.05079OpenAlexW2095696398MaRDI QIDQ860459

Jun-Ming Xu, Jia Huang, Fang Tian

Publication date: 9 January 2007

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

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

zbMATH Keywords

\(k\)-independent set\(k\)-domination number\(k\)-independent domination number\(k\)-irredundance numberconnected \(k\)-domination number

Mathematics Subject Classification ID

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

Related Items (2)

A general method in the theory of domination in graphs ⋮ Connected Domination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on total domination
• Some inequalities about connected domination number
• The diversity of domination
• On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
• On connected \(k\)-domination numbers of graphs.
• Graph-theoretic parameters concerning domination, independence, and irredundance
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• The ratio of the distance irredundance and domination numbers of a graph
• Theory and Application of Graphs

This page was built for publication: Distance irredundance and connected domination numbers of a graph