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: | , , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2006
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/7835 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | 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 state is solvable. If all initial states of a graph are solvable, we call the graph a solvable graph. We investigate the solvability of the join of two graphs. |
|---|