Abstract
Let G be a graph in which each vertex can be in one of two states: on or off. In the σ-game, when you “push” a vertex v you change the state of all of its neighbors, while in the σ+-game you change the state of v as well. Given a starting configuration of on vertices, the object of both games is to reduce it, by a sequence of pushes, to the smallest possible number of on vertices. We show that any starting configuration in a graph with no isolated vertices can, by a sequence of pushes, be reduced to at most half on, and we characterize those graphs for which you cannot do better. The proofs use techniques from coding theory. In the lit-only versions of these two games, you can only push vertices which are on. We obtain some results on the minimum number of on vertices one can obtain in grid graphs in the regular and lit-only versions of both games.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amin, A., Clark, L., Slater, P.: Parity dimension for graphs. Disc. Math. 187, 1–17 (1998)
Anderson, M., Feil, T.: Turning lights out with linear algebra. Math. Mag. 71, 300–303 (1998)
Cowen, R., Hechler, S., Kennedy, J., Ryba, A.: Inversion and neighborhood inversion in graphs. Graph Theory Notes XXXVII, 38–42 (1999)
Chang, G.: Vogan diagrams in the classification of real simple Lie algebras, plenary talk and the Third Pacific Conference of Mathematics, Shanghai China (2005)
Chuah, M.K., Hu, C.C.: Equivalence classes of Vogan diagrams. J. Algebra 279, 22–37 (2004)
Eriksson, H., Eriksson, K., Sjöstrand, J.: Note on the lamp-lighting problem. Adv. Appl. Math. 27, 357–366 (2001)
Goldwasser, J., Klostermeyer, W., Trapp, G.: Characterizing switch-setting problems. Linear Multilinear Algebra 43, 121–135 (1997)
Goldwasser, J., Klostermeyer, W.: Maximization versions of “lights out” games in grids and graphs. Cong. Num. 126, 99–111 (1997)
Goldwasser, J., Klostermeyer, W., Ware, H.: Fibonacci polynomials and parity domination in grid graphs. Graphs Comb. 18, 271–283 (2002)
Goldwasser, J., Klostermeyer, W.: Odd and even dominating sets with open neighborhoods. Ars Comb. 83, 229–247 (2007)
Goldwasser, J., Wang, X., Wu, Y.: Does the lit-only restriction make any difference for the σ-game and σ+-game? Eur. J. Comb. (2008). doi:10.1016/j.ejc.2008.02003
Sutner, K.: Linear cellular automata and the garden-of-eden. Math. Intell. 11, 49–53 (1989)
Hurlbert, G.: A survey if graph pebbling. Cong. Num. 139, 41–64 (1999)
Wang, X., Wu, Y.: Minimum light number of lit-only σ-game on a tree. Theor. Comput. Sci. 381, 292–300 (2007)
Wang, X., Wu, Y.: σ-game on a tree: covering radius and tree order. manuscript (2008)
Wu, Y.: Lit-only σ-game on a line-graph. Eur. J. Comb. (2008). doi:10.1016/j.ejc.2008.02003
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Goldwasser, J.L., Klostermeyer, W.F. Maximum Orbit Weights in the σ-game and Lit-only σ-game on Grids and Graphs. Graphs and Combinatorics 25, 309–326 (2009). https://doi.org/10.1007/s00373-009-0841-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-009-0841-0