On distance connected domination numbers of graphs.

zbMATH Open1212.05201MaRDI QIDQ3568754FDOQ3568754

Authors: Fang Tian, Jun-Ming Xu 

Publication date: 15 June 2010

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

zbMATH Keywords

distancedominationconnected \(k\)-domination number

Mathematics Subject Classification ID

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

Cited In (19)

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

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)