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: | Gervacio, Severino V., Lim, Yvette F., Ruivivar, Leonor A. |
---|---|
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 |
Similar Items
-
Solvable trees
by: Gervacio, Severino V., et al.
Published: (2008) -
The dimension of the join of two graphs
by: Gervacio, Severino V., et al.
Published: (2005) -
Subdivision number of large complete graphs and large complete multipartite graphs
by: Gervacio, Severino V.
Published: (2005) -
Resistance distance in complete n-partite graphs
by: Gervacio, Severino V.
Published: (2016) -
On the fold thickness of graphs
by: Campeña, Francis Joseph H., et al.
Published: (2020)