Solvable join of graphs
Initially, assign the state O or 1 to each vertex of a graph G. For each vertex v of G, let the move [v] mean switch the state of vertex v and each vertex adjacent to v. If there is a sequence of moves that brings the graph G to the 0-state (all vertices have O state) we say that the given initial...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | text |
| 出版: |
Animo Repository
2006
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/7835 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|