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 |
| id |
oai:animorepository.dlsu.edu.ph:faculty_research-8506 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-85062022-11-18T00:40:53Z Solvable join of graphs Gervacio, Severino V. Lim, Yvette F. Ruivivar, Leonor A. 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. 2006-08-01T07:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/7835 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 join of graphs |
| description |
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. |
| 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 join of graphs |
| title_short |
Solvable join of graphs |
| title_full |
Solvable join of graphs |
| title_fullStr |
Solvable join of graphs |
| title_full_unstemmed |
Solvable join of graphs |
| title_sort |
solvable join of graphs |
| publisher |
Animo Repository |
| publishDate |
2006 |
| url |
https://animorepository.dlsu.edu.ph/faculty_research/7835 |
| _version_ |
1767196763142225920 |