| Naslov: | Thresholds for the biased Maker-Breaker domination games |
|---|
| Avtorji: | ID Brešar, Boštjan (Avtor)
ID Bujtás, Csilla (Avtor)
ID Dokyeesun, Pakanun (Avtor)
ID Dravec, Tanja (Avtor) |
|---|
| Datoteke: |  PDF - Predstavitvena datoteka, prenos (415,24 KB)
MD5: BB9B0FBFFC769006FAC46A3270AB20E2
 URL - Izvorni URL, za dostop obiščite https://dmtcs.episciences.org/16768
|
|---|
| Jezik: | Angleški jezik |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: |  IMFM - Inštitut za matematiko, fiziko in mehaniko
|
|---|
| Povzetek: | 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. |
|---|
| Ključne besede: | Maker-Breaker domination game, biased Maker-Breaker game, trees, line graph, grid |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija 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/DiRROS-23918  |
|---|
| UDK: | 519.17 |
|---|
| ISSN pri članku: | 1365-8050 |
|---|
| DOI: | 10.46298/dmtcs.15392 |
|---|
| COBISS.SI-ID: | 254459907 |
|---|
| Opomba: |
|
|---|
| Datum objave v DiRROS: | 23.10.2025 |
|---|
| Število ogledov: | 167 |
|---|
| Število prenosov: | 102 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
