A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Game domination number
2002
Discrete Mathematics
The game domination number of a (simple, undirected) graph is deÿned 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 deÿned if we suppose that both
doi:10.1016/s0012-365x(00)00358-7
fatcat:b7ayobluunac5d77h7lpo4spbm