Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-89550-3_8 | KyotoCGGT |
Keywords | DocType | Citations |
solvable graph,solvable tree,initial state,simple graph,vertex i,Solvable Trees | Conference | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Severino V. Gervacio | 1 | 22 | 6.38 |
| Yvette F. Lim | 2 | 0 | 0.68 |
| Leonor A. Ruivivar | 3 | 0 | 0.34 |