Advertisement

Graphs and Combinatorics

, Volume 27, Issue 1, pp 109–119 | Cite as

A Note on Lights-Out-Puzzle: Parity-State Graphs

  • Severino V. Gervacio
  • Hiroshi MaeharaEmail author
Original Paper

Abstract

A state of a graph G is an assignment of 0 or 1 to each vertex of G. A move of a state consists of choosing a vertex and then switching the value of the vertex as well as those of its neighbors. Two states are said to be equivalent if one state can be changed to the other by a series of moves. A parity-state graph is defined to be a graph in which two states are equivalent if and only if the numbers of 1’s in the two states have the same parity. We characterize parity-state graphs and present some constructions of parity-state graphs together with applications. Among other things, it is proved that the one-skeleton of the 3-polytope obtained from a simple 3-polytope by cutting off all vertices is a parity-state graph.

Keywords

Lights-out-puzzle Parity-state graph Solvable graph Dependency 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anderson M., Feil T.: Turning lights out with linear algebra. Math. Mag. 71, 300–303 (1998)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Amin A., Clark L., Slater P.: Parity dimension for graphs. Discrete Math. 187, 1–17 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Amin A., Slater P.: All parity realizable trees. J. Combin. Math. Comput. 20, 53–63 (1996)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Araújo P.V.: How to turn all the lights out. Elem. Math. 55(4), 135–141 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Caro Y.: Simple proofs to three parity theorems. Ars Combin. 42, 175–180 (1996)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Caro Y., Klostermeyer W.: The odd domination number of a graph. J. Combin. Math. Comput. 44, 65–83 (2003)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Caro Y., Klostermeyer W., Yuster R.: Connected dominating sets in graphs. Discuss. Math. Graph Theory 25, 225–239 (2005)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Goldwasser J., Klostermeyer W.: Maximization versions of “lights out” games in grids and graphs. Congr. Numer. 126, 99–111 (1997)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Goldwasser J., Klostermeyer W.: Parity dominating sets in grid graphs. Congr. Numer. 172, 79–95 (2005)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Sutner K.: Linear cellular automata and the garden-of-eden. Math. Intelligencer 11, 49–53 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Sutner K.: The σ-game and cellular automata. Am. Math. Monthly 97, 24–34 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Sutner K.: On σ-automata. Complex Syst. 2, 1–28 (1988)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer 2010

Authors and Affiliations

  1. 1.Department of MathematicsDe La Salle UniversityManilaPhilippines
  2. 2.Research Institute of Educational DevelopmentTokai UniversityTokyoJapan

Personalised recommendations