Game Total Domination Critical Graphs
Michael A. Henning, Sandi Klav\v{z}ar, Douglas F. Rall

TL;DR
This paper introduces and characterizes total domination game critical graphs, analyzing their properties on cycles, paths, and joins, and determining conditions for criticality based on the total domination game number.
Contribution
It defines total domination game critical graphs and provides complete characterizations for cycles, paths, and joins, advancing understanding of game-critical graph structures.
Findings
Cycle $C_n$ is $ ext{γ}_{ ext{tg}}$-critical iff $n mod 6 otin ext{{2,4}}$
Path $P_n$ is $ ext{γ}_{ ext{tg}}$-critical iff $n mod 6 otin ext{{0,1,5}}$
Characterization of 2- and 3-$ ext{γ}_{ ext{tg}}$-critical graphs
Abstract
In the total domination game played on a graph , players Dominator and Staller alternately select vertices of , as long as possible, such that each vertex chosen increases the number of vertices totally dominated. Dominator (Staller) wishes to minimize (maximize) the number of vertices selected. The game total domination number, , of is the number of vertices chosen when Dominator starts the game and both players play optimally. If a vertex of is declared to be already totally dominated, then we denote this graph by . In this paper the total domination game critical graphs are introduced as the graphs for which holds for every vertex in . If , then is called --critical. It is proved that the cycle is -critical if and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
