Solvable trees

• Main Authors: Gervacio, Severino V., Lim, Yvette F., Ruivivar, Leonor A.
• Format: text
• Published: Animo Repository 2008
• Subjects: Graph theory; Mathematics
• Online Access: https://animorepository.dlsu.edu.ph/faculty_research/468
• Institution: De La Salle University

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