论文信息 - On the Computational Complexity of the Domination Game

On the Computational Complexity of the Domination Game

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 ).

Simon Schmidt | Sandi Klav

[1] Csilla Bujtás,et al. The Disjoint Domination Game , 2014, Discret. Math..

[2] Gasper Kosmrlj,et al. Guarded subgraphs and the domination game , 2015, Discret. Math. Theor. Comput. Sci..

[3] Csilla Bujtás. Domination game on forests , 2015, Discret. Math..

[4] Gasper Kosmrlj,et al. Domination game: Extremal families of graphs for 3/53/5-conjectures , 2013, Discret. Appl. Math..

[5] Reza Zamani,et al. Extremal Problems for Game Domination Number , 2013, SIAM J. Discret. Math..

[6] Paul Dorbec,et al. Complexity of the Game Domination Problem , 2016, Theor. Comput. Sci..

[7] Csilla Bujtás. On the Game Domination Number of Graphs with Given Minimum Degree , 2015, Electron. J. Comb..

[8] Gasper Kosmrlj. Realizations of the game domination number , 2014, J. Comb. Optim..

[9] Sandi Klavzar,et al. Domination Game and an Imagination Strategy , 2010, SIAM J. Discret. Math..

[10] Paul Dorbec,et al. The domination game played on unions of graphs , 2015, Discret. Math..

[11] Hossein Soltani,et al. Characterisation of forests with trivial game domination numbers , 2016, J. Comb. Optim..

[12] Michael A. Henning,et al. The 4/5 upper bound on the game total domination number , 2017, Comb..

[13] Gasper Kosmrlj,et al. On graphs with small game domination number , 2016 .

[14] Michael A. Henning,et al. Total Version of the Domination Game , 2015, Graphs Comb..