Connected domination game played on Cartesian products

DOI10.1515/MATH-2019-0111OpenAlexW2985274398MaRDI QIDQ2111699FDOQ2111699

Vesna Iršič, Csilla Bujtás, Sandi Klavžar, Pakanun Dokyeesun

Publication date: 17 January 2023

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2019-0111

zbMATH Keywords

Cartesian product of graphsdomination gamepaths and cyclesconnected domination game

Mathematics Subject Classification ID

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

Cites Work

• Domination Game and an Imagination Strategy
• The domination game played on unions of graphs
• Total version of the domination game
• Extremal Problems for Game Domination Number
• Domination game: effect of edge- and vertex-removal
• The disjoint domination game
• THE DOMINATION GAME ON SPLIT GRAPHS
• Connected domination game
• Topics in graph theory. Graphs and their Cartesian product
• Vizing's conjecture: a survey and recent results
• Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
• Bounds on the game transversal number in hypergraphs
• How long can one bluff in the domination game?
• Domination game on paths and cycles
• Maker-Breaker domination game
• The 4/5 upper bound on the game total domination number
• The variety of domination games
• On the game total domination number
• Progress towards the total domination game \(\frac{3}{4}\)-conjecture
• 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
• Maker-breaker domination number
• Connected domination game: Predomination, Staller-start game, and lexicographic products

Cited In (7)

• Total connected domination game
• The disjoint domination game
• Connected Domination
• Predominating a vertex in the connected domination game
• Connected domination game: Predomination, Staller-start game, and lexicographic products
• General upper bound on the game domination number
• A proof of the 3/4-conjecture for the total domination game

This page was built for publication: Connected domination game played on Cartesian products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111699)