Game domination number

The game domination number of a (simple, undirected) graph is defined by the following game. Two players, A and D, orient the edges of the graph alternately until all edges are oriented. Player D starts the game, and his goal is to decrease the domination number of the resulting digraph, while A is trying to increase it. The game domination number of the graph G, denoted by γg(G), is the domination number of the directed graph resulting from this game. This is well defined if we suppose that both players follow their optimal strategies. We determine the game domination number for several classes of graphs and provide general inequalities relating it to other graph parameters.

[1]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[2]  Noga Alon,et al.  The Acyclic Orientation Game on Random Graphs , 1995, Random Struct. Algorithms.

[3]  Béla Bollobás,et al.  The oriented cycle game , 1998, Discret. Math..

[4]  Michael Tarsi.  On the decomposition of a graph into stars , 1981, Discret. Math..

[5]  Lutz Volkmann,et al.  A new domination conception , 1993, J. Graph Theory.

[6]  Zsolt Tuza,et al.  Searching for acyclic orientations of graphs , 1995, Discret. Math..

[7]  E. A. Nordhaus,et al.  On Complementary Graphs , 1956 .

[8]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.