Domination game: effect of edge- and vertex-removal

The domination game is played on a graph $G$ by two players, named Dominator and Staller. They alternatively select vertices of $G$ such that each chosen vertex enlarges the set of vertices dominated before the move on it. Dominator's goal is that the game is finished as soon as possible, while Staller wants the game to last as long as possible. It is assumed that both play optimally. Game 1 and Game 2 are variants of the game in which Dominator and Staller has the first move, respectively. The game domination number $γ_g(G)$, and the Staller-start game domination number $γ_g'(G)$, is the number of vertices chosen in Game 1 and Game 2, respectively. It is proved that if $e\in E(G)$, then $|γ_g(G) - γ_g(G-e)| \le 2$ and $|γ_g'(G) - γ_g'(G-e)| \le 2$, and that each of the possibilities here is realizable by connected graphs $G$ for all values of $γ_g(G)$ and $γ_g'(G)$ larger than 5. For the remaining small values it is either proved that realizations are not possible or realizing examples are provided. It is also proved that if $v\in V(G)$, then $γ_g(G) - γ_g(G-v) \le 2$ and $γ_g'(G) - γ_g'(G-v) \le 2$. Possibilities here are again realizable by connected graphs $G$ in almost all the cases, the exceptional values are treated similarly as in the edge-removal case.