Domination Game Critical Graphs
The domination game is played on a graph G by two players who alternately take turns by choosing a vertex such that in each turn at least one previously undominated vertex is dominated. The game is over when each vertex becomes dominated. One of the players, namely Dominator, wants to finish the gam...
Main Authors: | Bujtás Csilla, Klavžar Sandi, Košmrlj Gašper |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1839 |
Similar Items
-
Total connected domination game
by: Csilla Bujtás, et al.
Published: (2021-07-01) -
How Long Can One Bluff in the Domination Game?
by: Brešar Boštan, et al.
Published: (2017-05-01) -
Connected domination game played on Cartesian products
by: Bujtás Csilla, et al.
Published: (2019-11-01) -
Paired-domination game played in graphs
by: T.W. Haynes, et al.
Published: (2019-12-01) -
Roman game domination subdivision number of a graph
by: Jafar Amjadi, et al.
Published: (2013-12-01)