Solvable trees
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2008
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/468 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| id |
oai:animorepository.dlsu.edu.ph:faculty_research-1467 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-14672021-12-13T07:15:19Z Solvable trees Gervacio, Severino V. Lim, Yvette F. Ruivivar, Leonor A. 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. © 2008 Springer Berlin Heidelberg. 2008-12-01T08:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/468 Faculty Research Work Animo Repository Graph theory Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| topic |
Graph theory Mathematics |
| spellingShingle |
Graph theory Mathematics Gervacio, Severino V. Lim, Yvette F. Ruivivar, Leonor A. Solvable trees |
| description |
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. © 2008 Springer Berlin Heidelberg. |
| format |
text |
| author |
Gervacio, Severino V. Lim, Yvette F. Ruivivar, Leonor A. |
| author_facet |
Gervacio, Severino V. Lim, Yvette F. Ruivivar, Leonor A. |
| author_sort |
Gervacio, Severino V. |
| title |
Solvable trees |
| title_short |
Solvable trees |
| title_full |
Solvable trees |
| title_fullStr |
Solvable trees |
| title_full_unstemmed |
Solvable trees |
| title_sort |
solvable trees |
| publisher |
Animo Repository |
| publishDate |
2008 |
| url |
https://animorepository.dlsu.edu.ph/faculty_research/468 |
| _version_ |
1720527904870236160 |