On distance connected domination numbers of graphs.

MaRDI QIDQ3568754zbMATH OpenFDO

Authors Fang Tian, Jun-Ming Xu

Publication date 15 June 2010

zbMATH Keywords

connected \(k\)-domination numberdistancedomination

Mathematics Subject Classification ID

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

Recommendations

• Distance domination in graphs with given minimum and maximum degree
• On connected k-domination numbers of graphs.
• Average distances and distance domination numbers
• Bounds on the connected \(k\)-domination number in graphs
• Distance domination in graphs

Cited in

(19)

• Connected \(k\)-dominating graphs
• Distance domination and distance irredundance in graphs
• Distance domination in graphs with given minimum and maximum degree
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Dominating a family of graphs with small connected subgraphs
• k-domination and connected k-domination in graphs
• Bounds for distance domination numbers of graphs
• Connected domination
• Distance domination in graphs
• A note on distance domination numbers of graphs
• Lower bounds on the distance domination number of a graph
• scientific article; zbMATH DE number 2104819 (Why is no real title available?)
• On dominated graphs
• Distance-k locating-dominating sets in graphs
• On distance \(r\)-dominating and \(2r\)-independent sets in sparse graphs
• Bounds on the connected \(k\)-domination number in graphs
• The extended dominating sets in graphs
• Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
• Distance irredundance and connected domination numbers of a graph

This page was built for publication: On distance connected domination numbers of graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568754)