Realizations of the game domination number
Realizations of the game domination number
复制标题
DOI：
10.1007/s10878-012-9572-x
复制
发表时间：
2012-11
影响因子：
1
通讯作者：
Gasper Kosmrlj
中科院分区：
文献类型：
--
作者：
Gasper Kosmrlj
Domination game is a game on a finite graph which includes two players. First player, Dominator, tries to dominate a graph in as few moves as possible; meanwhile the second player, Staller, tries to hold him back and delay the end of the game as long as she can. In each move at least one additional vertex has to be dominated. The number of all moves in the game in which Dominator makes the first move and both players play optimally is called the game domination number and is denoted by. The total number of moves in a Staller-start game is denoted by. It is known thatfor any graph. Graphrealizes a pairifand. It is shown that pairsfor allcan be realized by a family of 2-connected graphs. We also present 2-connected classes which realize pairsand. Exact game domination number for combs and 1-connected realization of the pairare also given.
