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...
Saved in:
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 |
Similar Items
-
On the fold thickness of graphs
by: Campeña, Francis Joseph H., et al.
Published: (2020) -
On the fold thickness of some classes of graphs
by: Campena, Francis Joseph H.
Published: (2006) -
On the fold thickness of bipartite doubles and other classes of graphs
by: Alcanites, Ma. Michelle B., et al.
Published: (2009) -
On the fold thickness of bipartite doubles and other classes of graphs
by: Alcanites, Ma. Michelle B., et al.
Published: (2009) -
Some universal graphs
by: Bautista, Paolo Lorenzo Y., et al.
Published: (2009)