Mycielskian of graphs with small game domination number

DOI10.26493/2590-9770.1484.40ezbMath1502.05164OpenAlexW4212813157MaRDI QIDQ5058212

Tijo James, Ambat Vijayakumar

Publication date: 19 December 2022

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/2590-9770.1484.40e

zbMATH Keywords

domination gameMycielskian of a graph

Mathematics Subject Classification ID

Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• The domination game played on unions of graphs
• How long can one bluff in the domination game?
• On the game domination number of graphs with given minimum degree
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• On graphs with largest possible game domination number
• Domination game: effect of edge- and vertex-removal
• Theoretical computer science and discrete mathematics. First international conference, ICTCSDM 2016, Krishnankoil, India, December 19--21, 2016. Revised selected papers
• Domination game on forests
• The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
• Domination Game and an Imagination Strategy
• Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
• Extremal Problems for Game Domination Number

This page was built for publication: Mycielskian of graphs with small game domination number