Laura E. Ballard, Erica L. Budge and Darin R.
Stephenson
Vol. 12 (2019), No. 2, 181–201
DOI: 10.2140/involve.2019.12.181
Abstract
The Lights Out problem on graphs, in which each vertex of the graph is in one of two
states (“on” or “off”), has been investigated from a variety of perspectives over the
last several decades, including parity domination, cellular automata, and harmonic
functions on graphs. We consider a variant of the Lights Out problem in
which the possible states for each vertex are indexed by the integers modulo
. We
examine the space of “null patterns” (i.e., harmonic functions) on graphs, and use this
as a way to prove theorems about Lights Out on graphs that are related to one
another by two main constructions.
PDF Access Denied
We have not been able to recognize your IP address
18.188.168.28
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.