Connected odd dominating sets in graphs

DOI10.7151/DMGT.1276MaRDI QIDQ5492638zbMATH OpenOpenAlexFDO

Authors Yair Caro, William F. Klostermeyer, Raphael Yuster

Publication date 16 October 2006

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

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.6659

zbMATH Keywords

dominating set

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 436064
• Odd and even dominating sets with open neighborhoods.
• scientific article; zbMATH DE number 1934394
• Odd and residue domination numbers of a graph
• scientific article; zbMATH DE number 3873384

Cited in

(7)

• On the complexity of dominating set problems related to the minimum all-ones problem
• Odd and residue domination numbers of a graph
• A Survey of the Game “Lights Out!”
• scientific article; zbMATH DE number 1114019 (Why is no real title available?)
• scientific article; zbMATH DE number 7666240 (Why is no real title available?)
• On the complexity of finding large odd induced subgraphs and odd colorings
• A note on Lights-Out-puzzle: parity-state graphs

This page was built for publication: Connected odd dominating sets in graphs

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