Fold thickness of some graphs

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 determin...

Full description

Saved in:
Bibliographic Details
Main Authors: Campeña, Francis Joseph H., Morales, John Vincent S., Bautista, Paolo Lorenzo Y.
Format: text
Published: Animo Repository 2009
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/faculty_research/11219
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University