Vol. 9, No. 5, 2016

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

Volume 11, 1 issue

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
Cover Page
Editorial Board
Editors’ Addresses
Editors’ Interests
About the Journal
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Subscriptions
Editorial Login
Author Index
Coming Soon
Contacts
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
An iterative strategy for Lights Out on Petersen graphs

Bruce Torrence and Robert Torrence

Vol. 9 (2016), No. 5, 721–732
Abstract

We establish some preliminary results for Sutner’s σ+ game, known as Lights Out, played on the generalized Petersen graph P(n,k). While all regular Petersen graphs admit game configurations that are not solvable, we prove that every game on the P(2n,n) graph has a unique solution. Moreover, we introduce a simple iterative strategy for finding the solution to any game on P(2n,n), and generalize its application to a wider class of graphs.

Keywords
Lights Out, Petersen graph, game, sigma plus game
Mathematical Subject Classification 2010
Primary: 05C50, 37B99, 90C27, 91A43, 05C57
Milestones
Received: 30 August 2013
Revised: 25 May 2015
Accepted: 6 November 2015
Published: 25 August 2016

Communicated by Kenneth S. Berenhaut
Authors
Bruce Torrence
Department of Mathematics
Randolph–Macon College
P.O. Box 5005
Ashland, VA 23005
United States
Robert Torrence
Department of Mathematics
Virginia Polytechnic Institute and State University
Blacksburg, VA 24061
United States