Vol. 12, No. 2, 2019

Download this article
Download this article For screen
For printing
Recent Issues

Volume 12
Issue 2, 181–360
Issue 1, 1–180

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Subscriptions
Editorial Board
Editors’ Interests
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Editorial Login
Author Index
Coming Soon
Contacts
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Lights Out for graphs related to one another by constructions

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 k. 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.

Keywords
graph theory, Lights Out
Mathematical Subject Classification 2010
Primary: 05C50, 05C69
Milestones
Received: 15 December 2014
Revised: 6 September 2017
Accepted: 22 May 2018
Published: 8 October 2018

Communicated by Kenneth S. Berenhaut
Authors
Laura E. Ballard
Mathematics Department
Syracuse University
Syracuse, NY
United States
Erica L. Budge
Department of Mathematics
Hope College
Holland, MI
United States
Darin R. Stephenson
Department of Mathematics
Hope College
Holland, MI
United States