Solvable join of graphs

Authors

Severino V. Gervacio, De La Salle University, Manila
Yvette F. Lim, De La Salle University, Manila
Leonor A. Ruivivar, De La Salle University, Manila

College

College of Science

Department/Unit

Mathematics and Statistics Department

Document Type

Conference Proceeding

Source Title

Proceedings of the Osaka University - De La Salle University Academic Workshop

Volume

7

Publication Date

8-2006

Abstract

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.

html

Recommended Citation

Gervacio, S. V., Lim, Y. F., & Ruivivar, L. A. (2006). Solvable join of graphs. Proceedings of the Osaka University - De La Salle University Academic Workshop, 7 Retrieved from https://animorepository.dlsu.edu.ph/faculty_research/7835

Disciplines

Mathematics

Keywords

Graph theory

Upload File

wf_no