Partition strategies for the Maker-Breaker domination game
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929394299174912 |
|---|---|
| author | Bagan, Guillaume Duchêne, Eric Gledel, Valentin Lehtilä, Tuomo Parreau, Aline |
| author_facet | Bagan, Guillaume Duchêne, Eric Gledel, Valentin Lehtilä, Tuomo Parreau, Aline |
| contents | The Maker-Breaker domination game is a positional game played on a graph by two players called Dominator and Staller. The players alternately select a vertex of the graph that has not yet been chosen. Dominator wins if at some point the vertices she has chosen form a dominating set of the graph. Staller wins if Dominator cannot form a dominating set. Deciding if Dominator has a winning strategy has been shown to be a PSPACE-complete problem even when restricted to chordal or bipartite graphs. In this paper, we consider strategies for Dominator based on partitions of the graph into basic subgraphs where Dominator wins as the second player. Using partitions into cycles and edges (also called perfect [1,2]-factors), we show that Dominator always wins in regular graphs and that deciding whether Dominator has a winning strategy as a second player can be computed in polynomial time for outerplanar and block graphs. We then study partitions into subgraphs with two universal vertices, which is equivalent to considering the existence of pairing dominating sets with adjacent pairs. We show that in interval graphs, Dominator wins if and only if such a partition exists. In particular, this implies that deciding whether Dominator has a winning strategy playing second is in NP for interval graphs. We finally provide an algorithm in $n^{k+3}$ for $k$-nested interval graphs (i.e. interval graphs with at most $k$ intervals included one in each other). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_15165 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Partition strategies for the Maker-Breaker domination game Bagan, Guillaume Duchêne, Eric Gledel, Valentin Lehtilä, Tuomo Parreau, Aline Combinatorics Discrete Mathematics 05C57 G.2.2 The Maker-Breaker domination game is a positional game played on a graph by two players called Dominator and Staller. The players alternately select a vertex of the graph that has not yet been chosen. Dominator wins if at some point the vertices she has chosen form a dominating set of the graph. Staller wins if Dominator cannot form a dominating set. Deciding if Dominator has a winning strategy has been shown to be a PSPACE-complete problem even when restricted to chordal or bipartite graphs. In this paper, we consider strategies for Dominator based on partitions of the graph into basic subgraphs where Dominator wins as the second player. Using partitions into cycles and edges (also called perfect [1,2]-factors), we show that Dominator always wins in regular graphs and that deciding whether Dominator has a winning strategy as a second player can be computed in polynomial time for outerplanar and block graphs. We then study partitions into subgraphs with two universal vertices, which is equivalent to considering the existence of pairing dominating sets with adjacent pairs. We show that in interval graphs, Dominator wins if and only if such a partition exists. In particular, this implies that deciding whether Dominator has a winning strategy playing second is in NP for interval graphs. We finally provide an algorithm in $n^{k+3}$ for $k$-nested interval graphs (i.e. interval graphs with at most $k$ intervals included one in each other). |
| title | Partition strategies for the Maker-Breaker domination game |
| topic | Combinatorics Discrete Mathematics 05C57 G.2.2 |
| url | https://arxiv.org/abs/2406.15165 |