A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
2016
SIAM Journal on Discrete Mathematics
In the domination game on a graph G, the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated. This process eventually produces a dominating set of G; Dominator aims to minimize the size of this set, while Staller aims to maximize it. The size of the dominating set produced under optimal play is the game domination number of G, denoted by γ g (G). In this paper, we prove that γ g (G) ≤ 2n/3 for every n-vertex
doi:10.1137/140976935
fatcat:qvs3houftze5deukt2h4v2idg4