Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
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 …