Access the full text.
Sign up today, get DeepDyve free for 14 days.
G is a cograph
paper we have considered the Maker-Breaker domination number which is an optimization problem from Dominator’s point of view
P. Dorbec, Gasper Kosmrlj, Gabriel Renault (2015)
The domination game played on unions of graphsDiscret. Math., 338
M. Nadjafi-Arani, M. Siggers, H. Soltani (2016)
Characterisation of forests with trivial game domination numbersJournal of Combinatorial Optimization, 32
Asaf Ferber, M. Krivelevich, Gal Kronenberg (2014)
Efficient Winning Strategies in Random‐Turn Maker–Breaker GamesJournal of Graph Theory, 85
Case 2.2: The only undominated vertices in H lie on P
Michael Albert, R. Nowakowski, David Wolfe (2019)
Combinatorial GamesLessons in Play
Éric Duchêne, Valentin Gledel, Aline Parreau, Gabriel Renault (2018)
Maker-Breaker domination gameDiscret. Math., 343
Simon Schmidt (2015)
The 3/5-conjecture for weakly S(K1, 3)-free forestsDiscret. Math., 339
P. Erdös, J. Selfridge (1973)
On a Combinatorial GameJ. Comb. Theory, Ser. A, 14
(2012)
Game domination for grid-like graphs (manuscript
where G and H are arbitrary graphs and G H is the Cartesian product of G and H
Dennis Clemens, Mirjana Mikalački (2016)
How fast can Maker win in fair biased games?Discret. Math., 341
Bill Kinnersley, D. West, R. Zamani (2013)
Extremal Problems for Game Domination NumberSIAM J. Discret. Math., 27
As we already mentioned, it would be interesting to find a structural characterization of the graphs G for which γ MB (G) = γ (G) = k holds
M. Krivelevich (2014)
Positional Games
B. Brešar, S. Klavžar, D. Rall (2010)
Domination Game and an Imagination StrategySIAM J. Discret. Math., 24
(2000)
(cid:32)Luczak
Michael Henning, Christian Löwenstein (2017)
Domination Game: Extremal Families for the 3/5-Conjecture for ForestsDiscussiones Mathematicae Graph Theory, 37
Kexiang Xu, Xia Li, S. Klavžar (2017)
On graphs with largest possible game domination numberDiscret. Math., 341
Sonny Ben-Shimon, M. Krivelevich, B. Sudakov (2009)
Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular GraphsCombinatorics, Probability and Computing, 20
J. Beck (2008)
Combinatorial Games: Tic-Tac-Toe Theory
Valentin Gledel, Michael Henning, Vesna Iršič, S. Klavžar (2019)
Maker-Breaker total domination gameDiscret. Appl. Math., 282
P. Dorbec, Michael Henning (2016)
Game total domination for cycles and pathsDiscret. Appl. Math., 208
M. Bednarska, T. Luczak (2000)
Biased Positional Games for Which Random Strategies are Nearly OptimalCombinatorica, 20
Gasper Kosmrlj (2017)
Domination game on paths and cyclesArs Math. Contemp., 13
B. Brešar, S. Klavžar, D. Rall (2012)
Domination game played on trees and spanning subgraphsDiscret. Math., 313
R. Guy (2000)
Combinatorial Games
S Schmidt (2016)
The 3/5-conjecture for weakly $$S(K_{1,3})$$ S ( K 1 , 3 ) -free forestsDiscrete Math., 339
Dennis Clemens, Asaf Ferber, M. Krivelevich, Anita Liebenau (2012)
Fast Strategies In Maker–Breaker Games Played on Random BoardsCombinatorics, Probability and Computing, 21
Csilla Bujtás (2014)
On the Game Domination Number of Graphs with Given Minimum DegreeElectron. J. Comb., 22
Michael Henning, D. Rall (2016)
Trees with equal total domination and game total domination numbersDiscret. Appl. Math., 226
Dan Hefetz, M. Krivelevich, Miloš Stojaković, Tibor Szabó (2009)
Fast winning strategies in Maker-Breaker gamesJ. Comb. Theory, Ser. B, 99
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
S. Connolly, Z. Gabor, A. Godbole, Bill Kay, T. Kelly (2013)
Bounds on the maximum number of minimum dominating setsDiscret. Math., 339
The Maker–Breaker domination game is played on a graph G by Dominator and Staller. The players alternatively select a vertex of G that was not yet chosen in the course of the game. Dominator wins if at some point the vertices he has chosen form a dominating set. Staller wins if Dominator cannot form a dominating set. In this paper, we introduce the Maker–Breaker domination number $$\gamma _{\mathrm{MB}}(G)$$ γ MB ( G ) of G as the minimum number of moves of Dominator to win the game provided that he has a winning strategy and is the first to play. If Staller plays first, then the corresponding invariant is denoted $$\gamma _{\mathrm{MB}}'(G)$$ γ MB ′ ( G ) . Comparing the two invariants, it turns out that they behave much differently than the related game domination numbers. The invariant $$\gamma _{\mathrm{MB}}(G)$$ γ MB ( G ) is also compared with the domination number. Using the Erdős-Selfridge criterion, a large class of graphs G is found for which $$\gamma _{\mathrm{MB}}(G) > \gamma (G)$$ γ MB ( G ) > γ ( G ) holds. Residual graphs are introduced and used to bound/determine $$\gamma _{\mathrm{MB}}(G)$$ γ MB ( G ) and $$\gamma _{\mathrm{MB}}'(G)$$ γ MB ′ ( G ) . Using residual graphs, $$\gamma _{\mathrm{MB}}(T)$$ γ MB ( T ) and $$\gamma _{\mathrm{MB}}'(T)$$ γ MB ′ ( T ) are determined for an arbitrary tree. The invariants are also obtained for cycles and bounded for union of graphs. A list of open problems and directions for further investigations is given.
Bulletin of the Malaysian Mathematical Sciences Society – Springer Journals
Published: Apr 5, 2019
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.