2000 character limit reached
Maker-Breaker total domination game on cubic graphs
Published 7 Oct 2020 in math.CO | (2010.03448v4)
Abstract: We study Maker--Breaker total domination game played by two players, Dominator and Staller, on the connected cubic graphs. Staller (playing the role of Maker) wins if she manages to claim an open neighbourhood of a vertex. Dominator wins otherwise (i.e.\ if he can claim a total dominating set of a graph). For certain graphs on $n\geq 6$ vertices, we give the characterization on those which are Dominator's win and those which are Staller's win.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.