Maker-Breaker domination game critical graphs

Abstract

The Maker-Breaker domination game (MBD game) is a two-player game played on a graph $G$ by Dominator and Staller. They alternately select unplayed vertices of $G$. The goal of Dominator is to form a dominating set with the set of vertices selected by him while that of Staller is to prevent this from happening. In this paper MBD game critical graphs are studied. Their existence is established and critical graphs are characterized for most of the cases in which the first player can win the game in one or two moves.

References in corpus (5)

• Maker-Breaker total domination game on cubic graphs
• Maker-Breaker domination number for Cartesian products of path graphs $P_2$ and $P_n$
• Maker-Breaker domination game on trees when Staller wins
• Maker-Breaker domination game on Cartesian products of graphs
• Maker-Breaker domination game played on corona products of graphs