Infinite families of circular and Möbius ladders that are total domination game critical
From MaRDI portal
Publication:1714056
DOI10.1007/s40840-018-0635-8zbMath1406.05069OpenAlexW2803252093MaRDI QIDQ1714056
Sandi Klavžar, Michael A. Henning
Publication date: 31 January 2019
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-018-0635-8
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Predominating a vertex in the connected domination game, Paired-Domination Game Played in Graphs, The variety of domination games, An Introduction to Game Domination in Graphs, Game total domination for cyclic bipartite graphs, Connected domination game: Predomination, Staller-start game, and lexicographic products, Connected domination game played on Cartesian products
Cites Work
- Unnamed Item
- Game total domination for cycles and paths
- The optimal rubbling number of ladders, prisms and Möbius-ladders
- Complexity of the game domination problem
- Characterisation of forests with trivial game domination numbers
- Total version of the domination game
- Domination game: extremal families for the 3/5-conjecture for forests
- On the game domination number of graphs with given minimum degree
- Domination game critical graphs
- The 4/5 upper bound on the game total domination number
- Game total domination critical graphs
- Realizations of the game domination number
- Trees with equal total domination and game total domination numbers
- The game total domination problem is log-complete in PSPACE
- Progress towards the total domination game \(\frac{3}{4}\)-conjecture
- The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
- Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
- Domination Game and an Imagination Strategy
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
- Total Domination in Graphs
- Extremal Problems for Game Domination Number