Isolation Game on Graphs
Graphs and Combinatorics · 2026-04 · 42 (2)
DOI: 10.1007/s00373-026-03030-y ↗Kurz gefasst
Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 03.03.2026. Verfasst von Boštjan Brešar und 4 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Javna Agencija za Raziskovalno Dejavnost RS.
Abstract (Originalsprache)
Given a graph G and a family of graphs $$\mathcal F$$ F , an $$\mathcal F$$ F -isolating set, as introduced by Caro and Hansberg, is any set $$S\subset V(G)$$ S ⊂ V ( G ) such that $$G - N[S]$$ G - N [ S ] contains no member of $$\mathcal F$$ F as a subgraph. In this paper, we introduce a game in which two players with opposite goals are together building an $$\mathcal F$$ F -isolating set in G . Following the domination games, Dominator (Staller) wants that the resulting $$\mathcal F$$ F -isolating set obtained at the end of the game, is as small (as big) as possible, which leads to the graph invariant called the game $$\mathcal F$$ F -isolation number, denoted $$\iota _\textrm{g}(G,\mathcal F)$$ ι g ( G , F ) . We prove that the Continuation Principle holds in the $$\mathcal F$$ F -isolation game, and that the difference between the game $$\mathcal F$$ F -isolation numbers when either Dominator or Staller starts the game is at most 1. Considering two arbitrary families of graphs $$\mathcal F$$ F and $$\mathcal F'$$ F ′ , we find relations between them that ensure $$\iota _\textrm{g}(G,{\mathcal {F}}') \le \iota _\textrm{g}(G,{\mathcal {F}})$$ ι g ( G , F ′ ) ≤ ι g ( G , F ) for any graph G . A special focus is given on the isolation game, which takes place when $$\mathcal {F}=\{K_2\}$$ F = { K 2 } . We prove that $$\iota _\textrm{g}(G,\{K_2\})\le |V(G)|/2$$ ι g ( G , { K 2 } ) ≤ | V ( G ) | / 2 for any graph G , and conjecture that $$\lceil 3|V(G)|/7\rceil $$ ⌈ 3 | V ( G ) | / 7 ⌉ is the actual (sharp) upper bound. We prove that the isolation game on a forest when Dominator has the first move never lasts longer than the one in which Staller starts the game. Finally, we prove good lower and upper bounds on the game isolation numbers of paths $$P_n$$ P n , which lead to the exact values $$\iota _\textrm{g}(P_n,\{K_2\})=\left\lfloor \frac{2n+2}{5}\right\rfloor $$ ι g ( P n , { K 2 } ) = 2 n + 2 5 when $$n \equiv i \pmod 5$$ n ≡ i ( mod 5 ) and $$i \in \{1,2,3\}.$$ i ∈ { 1 , 2 , 3 } .
Förderung
- Javna Agencija za Raziskovalno Dejavnost RS
Zitieren
APA
Brešar, B., Dravec, T., Johnston, D. P., Kuenzel, K., & Rall, D. F. (2026). Isolation Game on Graphs. Graphs and Combinatorics, 42(2). https://doi.org/10.1007/s00373-026-03030-y
Vancouver
Brešar B, Dravec T, Johnston DP, Kuenzel K, Rall DF. Isolation Game on Graphs. Graphs and Combinatorics. 2026;42(2). doi:10.1007/s00373-026-03030-y
BibTeX
@article{Brear2026,
author = {Brešar, Boštjan and Dravec, Tanja and Johnston, Daniel P. and Kuenzel, Kirsti and Rall, Douglas F.},
title = {Isolation Game on Graphs},
journal = {Graphs and Combinatorics},
year = {2026},
volume = {42},
number = {2},
doi = {10.1007/s00373-026-03030-y}
}
EUVIMED