How Long Can One Bluff in the Domination Game?
The domination game is played on an arbitrary graph G by two players, Dominator and Staller. The game is called Game 1 when Dominator starts it, and Game 2 otherwise. In this paper bluff graphs are introduced as the graphs in which every vertex is an optimal start vertex in Game 1 as well as in Game...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
University of Zielona Góra
2017-05-01
|
| シリーズ: | Discussiones Mathematicae Graph Theory |
| 主題: | |
| オンライン･アクセス: | https://doi.org/10.7151/dmgt.1899 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|