Total connected domination game
Csilla Bujt\'as, Michael A. Henning, Vesna Ir\v{s}i\v{c}, Sandi, Klav\v{z}ar

TL;DR
This paper studies the total connected domination game on graphs, establishing bounds on the game domination number, classifying graphs into classes based on these bounds, and characterizing certain classes of graphs.
Contribution
It introduces a classification of graphs based on the total connected domination game number and characterizes classes of trees and bipartite graphs within this framework.
Findings
The total connected game domination number differs from the connected game domination number by at most 2.
All connected Cartesian and direct product graphs with minimum degree at least 2 are Class 0.
No tree belongs to Class 2, and Class 1 trees are characterized.
Abstract
The (total) connected domination game on a graph is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirement that at each stage of the game the selected vertices induce a connected subgraph of . If Dominator starts the game and both players play optimally, then the number of vertices selected during the game is the (total) connected game domination number () of . We show that , and consequently define as Class if for . A large family of Class graphs is constructed which contains all connected Cartesian product graphs and connected direct product graphs with minumum degree at least . We show that no…
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.
Taxonomy
TopicsAdvanced Graph Theory Research
