| Tartalom: |
http://real.mtak.hu/39567/ |
| Archívum: |
MTA Könyvtár |
| Gyűjtemény: |
Status = Published
Type = Article
|
| Cím: |
The Disjoint Domination Game
|
| Létrehozó: |
Bujtás, Csilla
Tuza, Zsolt
|
| Kiadó: |
Elsevier
|
| Dátum: |
2016
|
| Téma: |
QA166-QA166.245 Graphs theory / gráfelmélet
|
| Tartalmi leírás: |
We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices. We prove that the maker has a winning strategy on all connected graphs if the game is started by the breaker. This implies the same in the (2:1) biased game also in the maker-start game. It remains open to characterize the maker-win graphs in the maker-start non-biased game, and to analyze the (a:b) biased game for (a:b)≠(2:1). For a more restricted variant of the non-biased game we prove that the maker can win on every graph without isolated vertices. © 2015 Elsevier B.V.
|
| Nyelv: |
angol
|
| Típus: |
Article
PeerReviewed
info:eu-repo/semantics/article
|
| Formátum: |
text
|
| Azonosító: |
Bujtás, Csilla and Tuza, Zsolt (2016) The Disjoint Domination Game. Discrete Mathematics, 339 (7). pp. 1985-1992. ISSN 0012-365X
|
| Kapcsolat: |
MTMT:2975179; doi:10.1016/j.disc.2015.04.028
|
