Domination game and minimal edge cuts
Sandi Klav\v{z}ar, Douglas F. Rall

TL;DR
This paper explores the relationship between the domination game and minimal edge cuts in graphs, establishing bounds on the game domination number and introducing new graph classes to extend existing results.
Contribution
It establishes an upper bound on the game domination number based on minimal edge cuts and introduces Double-Staller graphs to demonstrate the bound's tightness.
Findings
Bound on game domination number using minimal edge cuts
Introduction of Double-Staller graphs for tightness demonstration
Extension of traceable graphs with known domination number bounds
Abstract
In this paper a relationship is established between the domination game and minimal edge cuts. It is proved that the game domination number of a connected graph can be bounded above in terms of the size of minimal edge cuts. In particular, if a minimum edge cut of a connected graph , then . Double-Staller graphs are introduced in order to show that this upper bound can be attained for graphs with a bridge. The obtained results are used to extend the family of known traceable graphs whose game domination numbers are at most one-half their order. Along the way two technical lemmas, which seem to be generally applicable for the study of the domination game, are proved.
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.
