Determinants of adjacency matrices of some graphs
The adjacency matrix of a graph G having vertices x1, x2,...,xn is the n x n matrix A(G)m= [aij] where aij = 1 if xi is adjacent to xj and xij = 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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2006
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/13457 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |