Fold thickness of some graphs

Authors

Francis Joseph H. Campeña, De La Salle University, Manila
John Vincent S. Morales, De La Salle University, Manila
Paolo Lorenzo Y. Bautista, De La Salle University, Manila

College

College of Science

Department/Unit

Mathematics and Statistics Department

Document Type

Archival Material/Manuscript

Publication Date

2009

Abstract

The adjacency matrix of a graph G having vertices x1, x2, . . . , xn is the n × n matrix A(G) = [aij ] where aij = 1 if xi is adjacent to xj and aij = 0 otherwise. We say that a graph is singular if its adjacency matrix is singular; otherwise we say that it is non-singular. Formulas for the determinant of some types of graphs such as combs, crowns, sparks and starpaths are shown in this paper and thus determining when these graphs are singular.

html

Recommended Citation

Campeña, F. H., Morales, J. S., & Bautista, P. Y. (2009). Fold thickness of some graphs. Retrieved from https://animorepository.dlsu.edu.ph/faculty_research/11219

Disciplines

Mathematics

Keywords

Graph theory

Upload File

wf_no