• EASYMOVE GAME REPRESENTED IN GRAPH DOMINATION

Abstract

The 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 by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible and Staller wishes to delay the process as much as possible. The game domination number  is the number of vertices chosen when Dominator starts the game and the Staller-star game domination number (G) when Staller starts the game. An imagination strategy is developed as a general tool for proving results on the domination game.Domination by pawns on a square beehive