A general method in the theory of domination in graphs
DOI10.1080/00207160903137167zbMATH Open1214.05105OpenAlexW1997356915MaRDI QIDQ3066944FDOQ3066944
Authors: 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
Recommendations
- Generalized domination and efficient domination in graphs
- Theory of domination in graphs
- A generalization of domination critical graphs
- scientific article; zbMATH DE number 1161247
- scientific article; zbMATH DE number 1095171
- On Domination in Graphs
- Generalized perfect domination in graphs
- Some results on domination in graphs
- scientific article; zbMATH DE number 1161346
- scientific article; zbMATH DE number 1002450
treedominationtotal dominationrestrained dominationconnected domination\(p\)-dominationdouble dominationdistance dominationpaired dominationirredundanceweakly connected dominationweak domination\(p\)-tuple dominationdistance irredundanceend domination
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (8)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- An integer programming approach for solving a generalized version of the Grundy domination number
- Extremal graphs for a new upper bound on domination parameters in graphs
- Title not available (Why is that?)
- Bounds on the connected \(k\)-domination number in graphs
- Connected domination
- Multiple domination
- Title not available (Why is that?)
This page was built for publication: A general method in the theory of domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066944)
