A general method in the theory of domination in graphs

DOI10.1080/00207160903137167zbMath1214.05105OpenAlexW1997356915MaRDI QIDQ3066944

Adriana Hansberg, Dirk Meierling, Lutz Volkmann

Publication date: 20 January 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903137167

zbMATH Keywords

treedominationirredundancerestrained dominationtotal dominationconnected dominationdouble domination\(p\)-dominationdistance dominationpaired dominationweakly connected dominationweak domination\(p\)-tuple dominationdistance irredundanceend domination

Mathematics Subject Classification ID

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

Related Items (4)

Bounds on the connected \(k\)-domination number in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Connected Domination ⋮ Multiple Domination

Cites Work

• Distance irredundance and connected domination numbers of a graph
• Restrained domination in trees
• Distance paired domination numbers of graphs

This page was built for publication: A general method in the theory of domination in graphs