Abstract
The 1/2-conjecture on the domination game asserts that if G is a traceable graph, then the game domination number γg (G) of G is at most A traceable graph is a 1/2-graph if holds. It is proved that the so-called hatted cycles are 1/2-graphs and that unicyclic graphs fulfill the 1/2-conjecture. Several additional families of graphs that support the conjecture are determined and computer experiments related to the conjecture described.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
