Maker-Breaker domination number for Cartesian products of path graphs $P_2$ and $P_n$

Maker-Breaker domination number for Cartesian products of path graphs $P_2$ and $P_n$

We study the Maker-Breaker domination game played by Dominator and Staller on the vertex set of a given graph. Dominator wins when the vertices he has claimed form a dominating set of the graph. Staller wins if she makes it impossible for Dominator to win, or equivalently, she is able to claim some...

Full description

Saved in:
Bibliographic Details
Main Authors: Jovana Forcan, Jiayue Qi
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2024-04-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
mathematics - combinatorics
91a24, 05c69, 05c57
Online Access:http://dmtcs.episciences.org/10465/pdf
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items