Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Domination Game Critical Graphs

Csilla BujtásSandi KlavžarGašper Košmrlj — 2015

Discussiones Mathematicae Graph Theory

The domination game is played on a graph G by two players who alternately take turns by choosing a vertex such that in each turn at least one previously undominated vertex is dominated. The game is over when each vertex becomes dominated. One of the players, namely Dominator, wants to finish the game as soon as possible, while the other one wants to delay the end. The number of turns when Dominator starts the game on G and both players play optimally is the graph invariant γg(G), named the game...

Page 1

Download Results (CSV)