On non-z(mod k) dominating sets

DOI10.7151/DMGT.1195zbMATH Open1050.05092OpenAlexW2014318504MaRDI QIDQ4458980FDOQ4458980

Authors: Yair Caro, Michael Jacobson 

Publication date: 25 March 2004

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

Full work available at URL: https://doi.org/10.7151/dmgt.1195

Recommendations

• On the number of dominating sets in some classes of trees
• Vertices contained in all or in no minimum \(k\)-dominating sets of a tree
• A note on obtaining \(k\) dominating sets from a \(k\)-dominating function on a tree
• Bounds on perfect \(k\)-domination in trees: an algorithmic approach
• scientific article; zbMATH DE number 1389216

zbMATH Keywords

treedominating set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (5)

• Haar null and non-dominating sets
• A counterexample to the lights out problem
• A Survey of the Game “Lights Out!”
• Nowhere \(0\) mod \(p\) dominating sets in multigraphs.
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs

This page was built for publication: On non-z(mod k) dominating sets

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