Abstract
The domination game is played on an arbitrary graph G by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer k is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph G inO(( G)j V (G)j k ) time. In the special case when k = 3 and the graph G considered has maximum diameter, the complexity is improved toO(jV (G)j j E(G)j + ( G) 3 ).
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 callMore From: Iranian Journal of Mathematical Sciences and Informatics
Disclaimer: 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.
