Name
Abstract | ||
|---|---|---|
A state of a graph G is an assignment of 0 or 1 to each vertex of G. A move of a state consists of choosing a vertex and then switching the value of the vertex as well as those of its neighbors. Two states are said to be equivalent if one state can be changed to the other by a series of moves. A parity-state graph is defined to be a graph in which two states are equivalent if and only if the numbers of 1’s in the two states have the same parity. We characterize parity-state graphs and present some constructions of parity-state graphs together with applications. Among other things, it is proved that the one-skeleton of the 3-polytope obtained from a simple 3-polytope by cutting off all vertices is a parity-state graph. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s00373-010-0958-1 | Graphs and Combinatorics |
Keywords | Field | DocType |
lights-out-puzzle · parity-state graph · solvable graph · dependency,parity-state graph,graph g,parity-state graphs,dependency | Topology,Discrete mathematics,Combinatorics,Circulant graph,Line graph,Forbidden graph characterization,Vertex (graph theory),Cycle graph,Neighbourhood (graph theory),Regular graph,Symmetric graph,Mathematics | Journal |
Volume | Issue | ISSN |
27 | 1 | 1435-5914 |
Citations | PageRank | References |
2 | 0.47 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Severino V. Gervacio | 1 | 22 | 6.38 |
| Hiroshi Maehara | 2 | 152 | 114.17 |