Extremal problems for game domination number

Abstract

In the domination game on a graph G, two players called Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated; the game ends when the chosen set becomes a dominating set of G. Dominator aims to minimize the size of the resulting dominating set, while Staller aims to maximize it. When both players play optimally, the size of the dominating set produced is the game domination number of G, denoted by γg(G) when Dominator plays first and by γ′g(G) when Staller plays first. We prove that γg(G) ≤ 7n/11 when G is an isolate-free n-vertex forest and that γg(G) ≤ ⌈7n/10 ⌉ for any isolate-free n-vertex graph. In both cases we conjecture that γg(G) ≤ 3n/5 and prove it when G is a forest of nontrivial caterpillars. We also resolve conjectures of Brešar, Klavžar, and Rall by showing that always γ′g(G) ≤ γg(G) + 1, that for k ≥ 2 there are graphs G satisfying γg(G) = 2k and γ′g(G) = 2k − 1, and that γ′g(G) ≥ γg(G) when G is a forest. Our results follow from fundamental lemmas about the domination game that simplify its analysis and may be useful in future research