Connected domination game played on Cartesian products

DOI10.1515/MATH-2019-0111MaRDI QIDQ2111699zbMATH OpenOpenAlexFDO

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

Publication date 17 January 2023

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

• Bounds on the game transversal number in hypergraphs
• Connected domination game
• Connected domination game: predomination, Staller-start game, and lexicographic products
• Domination game and an imagination strategy
• Domination game on paths and cycles
• Domination game: effect of edge- and vertex-removal
• Extremal problems for game domination number
• How long can one bluff in the domination game?
• Infinite families of circular and Möbius ladders that are total domination game critical
• Maker-Breaker domination game
• Maker-breaker domination number
• On domination game stable graphs and domination game edge-critical graphs
• On the game total domination number
• Progress towards the total domination game \(\frac{3}{4}\)-conjecture
• THE DOMINATION GAME ON SPLIT GRAPHS
• The 4/5 upper bound on the game total domination number
• The disjoint domination game
• The domination game played on unions of graphs
• The variety of domination games
• Topics in graph theory. Graphs and their Cartesian product
• Total version of the domination game
• Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
• Vizing's conjecture: a survey and recent results

Cited in

(7)

• The disjoint domination game
• Connected domination game: predomination, Staller-start game, and lexicographic products
• General upper bound on the game domination number
• Predominating a vertex in the connected domination game
• Total connected domination game
• Connected domination
• 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)