Abstract
A state of a simple graph G is an assignment of either a 0 or 1 to each of its vertices. For each vertex i of G, we define the move [i] to be the switching of the state of vertex i, and each neighbor of i, from 0 to 1, or from 1 to 0. The given initial state of G is said to be solvable if a sequence of moves exists such that this state is transformed into the 0-state (all vertices have state 0.) If every initial state of G is solvable, we call G a solvable graph. We shall characterize here the solvable trees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cowen, R., Kennedy, J.: The lights out puzzle. Mathematica in Education and Research 9(1), 28–32 (2000), http://library.wolfram.com/infocenter/Articles/1231/
Gervacio, S.V.: Trees with diameter less than 5 and nonsingular complement. Discrete Math. 151, 91–97 (1996)
Goldwasser, J., Klostermeyer, W.: Maximization Versions of ‘Lights Out’ Games in Grids and Graphs. Congr. Numer. 126, 99–111 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gervacio, S.V., Lim, Y.F., Ruivivar, L.A. (2008). Solvable Trees. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds) Computational Geometry and Graph Theory. KyotoCGGT 2007. Lecture Notes in Computer Science, vol 4535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89550-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-89550-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89549-7
Online ISBN: 978-3-540-89550-3
eBook Packages: Computer ScienceComputer Science (R0)