Key points are not available for this paper at this time.
In the Maker-Breaker domination game, Dominator and Staller play on a graph G by taking turns in which each player selects a not yet played vertex of G. Dominator's goal is to select all the vertices in a dominating set, while Staller aims to prevent this from happening. In this paper, the game is investigated on corona products of graphs. Its outcome is determined as a function of the outcome of the game on the second factor. Staller-Maker-Breaker domination numbers are determined for arbitrary corona products, while Maker-Breaker domination numbers of corona products are bounded from both sides. All the bounds presented are demonstrated to be sharp. Corona products as well as general graphs with small (Staller-) Maker-Breaker domination numbers are described.
Divakaran et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: