The variety of domination games
From MaRDI portal
Publication:2007624
Abstract: Domination game [SIAM J. Discrete Math. 24 (2010) 979--991] and total domination game [Graphs Combin. 31 (2015) 1453--1462] are by now well established games played on graphs by two players, named Dominator and Staller. In this paper, Z-domination game, L-domination game, and LL-domination game are introduced as natural companions of the standard domination games. Versions of the Continuation Principle are proved for the new games. It is proved that in each of these games the outcome of the game, which is a corresponding graph invariant, differs by at most one depending whether Dominator or Staller starts the game. The hierarchy of the five domination games is established. The invariants are also bounded with respect to the (total) domination number and to the order of a graph. Values of the three new invariants are determined for paths up to a small constant independent from the length of a path. Several open problems and a conjecture are listed. The latter asserts that the L-domination game number is not greater than of the order of a graph.
Recommendations
- Total version of the domination game
- Domination game and an imagination strategy
- Domination games played on graphs
- The disjoint domination game
- Predominance game
- Domination game on powers of cycles
- Game domination number
- The diversity of domination
- My favorite domination game conjectures
- Connected domination game
Cites work
- Characterisation of forests with trivial game domination numbers
- Complexity of the game domination problem
- Dominating sequences in graphs
- Domination game and an imagination strategy
- Domination game on forests
- Domination game on paths and cycles
- Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two
- Domination game: extremal families for the 3/5-conjecture for forests
- Domination game: extremal families of graphs for \(3/5\)-conjectures
- Extremal problems for game domination number
- Further progress on the heredity of the game domination number
- Game total domination critical graphs
- Game total domination for cycles and paths
- Grundy dominating sequences and zero forcing sets
- How long can one bluff in the domination game?
- Infinite families of circular and Möbius ladders that are total domination game critical
- On domination game stable graphs and domination game edge-critical graphs
- On graphs with largest possible game domination number
- On graphs with small game domination number
- On the game domination number of graphs with given minimum degree
- On the game total domination number
- Progress towards the total domination game \(\frac{3}{4}\)-conjecture
- The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
- The 4/5 upper bound on the game total domination number
- THE DOMINATION GAME ON SPLIT GRAPHS
- The domination game played on unions of graphs
- Total dominating sequences in graphs
- Total version of the domination game
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
- Trees with equal total domination and game total domination numbers
Cited in
(27)- The diversity of domination
- Cutting lemma and union lemma for the domination game
- \( 1 / 2\)-conjectures on the domination game and claw-free graphs
- Connected domination game played on Cartesian products
- The domination game played on diameter 2 graphs
- Predominating a vertex in the connected domination game
- General upper bound on the game domination number
- Z-domination game
- Fractional domination game
- Uniform length dominating sequence graphs
- The Game of Synchronized Domineering
- Total version of the domination game
- scientific article; zbMATH DE number 7355464 (Why is no real title available?)
- On Rall's 1/2-conjecture on the domination game
- Domination game on powers of cycles
- How long can one bluff in the domination game?
- Domination games played on graphs
- Connected domination game: predomination, Staller-start game, and lexicographic products
- Biased domination games
- Fast winning strategies for staller in the maker-breaker domination game
- Indicated domination game
- Paired-domination game played on paths
- Optimal strategies in fractional games: vertex cover and domination
- 4-total domination game critical graphs
- A proof of the 3/4-conjecture for the total domination game
- Paired-domination in binary trees
- Domination game: effect of edge contraction and edge subdivision
This page was built for publication: The variety of domination games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007624)
