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 |
| id |
oai:animorepository.dlsu.edu.ph:faculty_research-15182 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-151822024-11-16T03:11:27Z Determinants of adjacency matrices of some graphs Campena, Francis Joseph H. Gervacio, Severino V. 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 some types of graphs such as combs, crowns, sparks, and the star paths are shown in this paper and thus determining when these graphs are singular. 2006-08-01T07:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/13457 Faculty Research Work Animo Repository Graph theory Matrices Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| topic |
Graph theory Matrices Mathematics |
| spellingShingle |
Graph theory Matrices Mathematics Campena, Francis Joseph H. Gervacio, Severino V. Determinants of adjacency matrices of some graphs |
| description |
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 some types of graphs such as combs, crowns, sparks, and the star paths are shown in this paper and thus determining when these graphs are singular. |
| format |
text |
| author |
Campena, Francis Joseph H. Gervacio, Severino V. |
| author_facet |
Campena, Francis Joseph H. Gervacio, Severino V. |
| author_sort |
Campena, Francis Joseph H. |
| title |
Determinants of adjacency matrices of some graphs |
| title_short |
Determinants of adjacency matrices of some graphs |
| title_full |
Determinants of adjacency matrices of some graphs |
| title_fullStr |
Determinants of adjacency matrices of some graphs |
| title_full_unstemmed |
Determinants of adjacency matrices of some graphs |
| title_sort |
determinants of adjacency matrices of some graphs |
| publisher |
Animo Repository |
| publishDate |
2006 |
| url |
https://animorepository.dlsu.edu.ph/faculty_research/13457 |
| _version_ |
1816861369751830528 |