Some Winnability Results for the Neighborhood and Group Labeling Lights Out Games

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Doherty, Brittany, Miller, Christian J., Parker, Darren B.
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913340264022016
author Doherty, Brittany
Miller, Christian J.
Parker, Darren B.
author_facet Doherty, Brittany
Miller, Christian J.
Parker, Darren B.
contents We look at both the \emph{group labeling lights out game} and the \emph{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.
format Preprint
id arxiv_https___arxiv_org_abs_2405_02202
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Some Winnability Results for the Neighborhood and Group Labeling Lights Out Games
Doherty, Brittany
Miller, Christian J.
Parker, Darren B.
Combinatorics
05C20, 06B99
We look at both the \emph{group labeling lights out game} and the \emph{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.
title Some Winnability Results for the Neighborhood and Group Labeling Lights Out Games
topic Combinatorics
05C20, 06B99
url https://arxiv.org/abs/2405.02202