Domination gameBrešar, Boštjan (Avtor) Klavžar, Sandi (Avtor) Rall, Douglas F. (Avtor) teorija grafovteorija igerdominantnostVizingova domnevagraph theorygame theorydominationdomination gamegame domination numberVizing's conjectureThe domination game played on a graph ▫$G$▫ consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from ▫$G$▫ such that whenever a vertex is chosen the graph in as few steps as possible and Staller wishes to delay the process as much as possible. The game domination number ▫$gamma_g(G)$▫ is the number of vertices chosen when Dominator starts the game and the Staller-start game domination number ▫$gamma'_g(G)$▫ when Staller starts the game. It is proved that for any graph ▫$G$▫, ▫$gamma(G) le gamma_g(G) le 2gamma(G) - 1$▫, and that all possible values can be realized. It is also proved that for any graph ▫$G$▫, ▫$gamma_g(G) - 1 le gamma'_g(G) le gamma_g(G) + 2$▫, and that most of the possibilities for mutual values of ▫$gamma_g(G)$▫ and ▫$gamma'_g(G)$▫ can be realized. A connection with Vizing's conjecture is established and several problems and conjectures stated.20092015-07-10 15:06:27Delo ni kategorizirano51759ISSN: 1318-4865UDK: 519.17:519.83OceCobissID: 44310272COBISS_ID: 15032921NUK URN: URN:SI:UM:DK:FIGMXG8Zsl