A remark on the (2,2)-domination number

DOI10.7151/DMGT.1411MaRDI QIDQ3606460zbMATH OpenOpenAlexFDO

Authors Torsten Korneffel, Dirk Meierling, Lutz Volkmann

Publication date 26 February 2009

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/49fcaa77f0d071982e6a29db1115ff510a149972

zbMATH Keywords

dominationdistance domination number\(p\)-domination number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2188621
• Some upper bounds for 2-domination number of graphs and a Graffiti.pc conjecture
• 2-domination number of generalized Petersen graphs
• Bounds on the distance two-domination number of a graph
• scientific article; zbMATH DE number 5919758

Cited in

(6)

• The domination number of the graph defined by two levels of the \(n\)-cube. II
• Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Some upper bounds for 2-domination number of graphs and a Graffiti.pc conjecture
• On bondage numbers of graphs: a survey with some comments
• scientific article; zbMATH DE number 2188621 (Why is no real title available?)

This page was built for publication: A remark on the (2,2)-domination number

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