2024/05/03 by Doherty, Brittany, Miller, Christian J., Parker, Darren B.
#05C20 #06B99 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2405.02202
We look at both the group labeling lights out game and the neighborhood lights out game. Our main focus is to determine necessary and sufficient conditions for when the group labeling lights out game on path graphs, cycle graphs, and complete bipartite graphs can be won for every possible initial labeling. In the process of solving this problem, we demonstrate a new proof for when the neighborhood lights out game on complete bipartite graphs can be won for every possible initial labeling.