Thresholds for the biased Maker-Breaker domination games

Brešar, Boštjan (avtor), Bujtás, Csilla (avtor), Dokyeesun, Pakanun (avtor), Dravec, Tanja (avtor)

In the $(a,b)$-biased Maker-Breaker domination game, two players alternately select unplayed vertices in a graph $G$ such that Dominator selects $a$ and Staller selects $b$ vertices per move. Dominator wins if the vertices he selected during the game form a dominating set of $G$, while Staller wins if she can prevent Dominator from achieving this goal. Given a positive integer $b$, Dominator's threshold, ${\rm a}_b$, is the minimum $a$ such that Dominator wins the $(a,b)$-biased game on $G$ when he starts the game. Similarly, ${\rm a}'_b$ denotes the minimum $a$ such that Dominator wins when Staller starts the $(a,b)$-biased game. Staller's thresholds, ${\rm b}_a$ and ${\rm b}'_a$, are defined analogously. It is proved that Staller wins the $(k-1,k)$-biased games in a graph $G$ if its order is sufficiently large with respect to a function of $k$ and the maximum degree of $G$. Along the way, the $\ell$-local domination number of a graph is introduced. This new parameter is proved to bound Dominator's thresholds ${\rm a}_\ell$ and ${\rm a}_\ell'$ from above. As a consequence, ${\rm a}_1'(G)\le 2$ holds for every claw-free graph $G$. More specific results are obtained for thresholds in line graphs and Cartesian grids. Based on the concept of $[1,k]$-factor of a graph $G$, we introduce the star partition width $\sigma(G)$ of $G$, and prove that ${\rm a}_1'(G)\le \sigma(G)$ holds for any nontrivial graph $G$, while ${\rm a}_1'(G)=\sigma(G)$ if $G$ is a tree.

• Jezik: Angleški jezik
• Ključne besede: Maker-Breaker domination game, biased Maker-Breaker game, trees, line graph, grid
• Vrsta gradiva: Članek v reviji
• Tipologija: 1.01 - Izvirni znanstveni članek
• Organizacija: FMF - Fakulteta za matematiko in fiziko
• Status publikacije: Objavljeno
• Različica publikacije: Objavljena publikacija
• Datum objave: 01.01.2025
• Leto izida: 2025
• Št. strani: 19 str.
• Številčenje: Vol. 27, no. 3, article no. 19
• PID: 20.500.12556/RUL-175289
• UDK: 519.17
• ISSN pri članku: 1365-8050
• DOI: 10.46298/dmtcs.15392
• COBISS.SI-ID: 254459907
• Datum objave v RUL: 23.10.2025

Gradivo je del revije

• Naslov: Discrete mathematics & theoretical computer science
• Skrajšan naslov: Discret. math. theor. comput. sci.
• Založnik: DMTCS
• ISSN: 1365-8050
• COBISS.SI-ID: 8089433

Licence

• Licenca: CC BY-NC-SA 4.0, Creative Commons Priznanje avtorstva-Nekomercialno-Deljenje pod enakimi pogoji 4.0 Mednarodna
• Povezava: http://creativecommons.org/licenses/by-nc-sa/4.0/deed.sl
• Opis: Licenca Creative Commons, ki prepoveduje komercialno uporabo in zahteva, da uporabnik predelana dela objavi z enako licenco.

Sekundarni jezik

• Jezik: Slovenski jezik
• Ključne besede: dominacijska igra izdelovalec-lomilec, pristranska igra izdelovalec-lomilec, drevesa, graf povezav, mreža