On a modular domination game
نویسندگان
چکیده
منابع مشابه
On a modular domination game
We present a generalization of the so-called σ-game, introduced by Sutner [9], a combinatorial game played on a graph, with relations to cellular automata, as well as odd domination in graphs. A configuration on a graph is an assignment of values in {0, . . . , p− 1} (where p is an arbitrary positive integer) to all the vertices of G. One may think of a vertex v of G as a button the player can ...
متن کاملDomination game on forests
In the domination game studied here, Dominator and Staller alternately choose a vertex of a graph G and take it into a set D. The number of vertices dominated by the set D must increase in each single turn and the game ends when D becomes a dominating set of G. Dominator aims to minimize whilst Staller aims to maximize the number of turns (or equivalently, the size of the dominating set D obtai...
متن کاملDomination game on uniform hypergraphs
In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph H by two players, namely Dominator and Staller, who alternately select vertices such that each selected vertex enlarges the set of vertices dominated so far. The game is over if all vertices of H are dominated. Dominator aims to finish the game as soon as possible, while Staller aims to delay...
متن کاملDomination Game
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 γg...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00285-8