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...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | text |
| منشور في: |
Animo Repository
2009
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://animorepository.dlsu.edu.ph/faculty_research/11219 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | De La Salle University |
| id |
oai:animorepository.dlsu.edu.ph:faculty_research-10421 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-104212023-11-03T01:37:52Z Fold thickness of some graphs Campeña, Francis Joseph H. Morales, John Vincent S. Bautista, Paolo Lorenzo Y. 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. 2009-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/11219 Faculty Research Work Animo Repository Graph theory 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 Mathematics |
| spellingShingle |
Graph theory Mathematics Campeña, Francis Joseph H. Morales, John Vincent S. Bautista, Paolo Lorenzo Y. Fold thickness of some graphs |
| description |
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. |
| format |
text |
| author |
Campeña, Francis Joseph H. Morales, John Vincent S. Bautista, Paolo Lorenzo Y. |
| author_facet |
Campeña, Francis Joseph H. Morales, John Vincent S. Bautista, Paolo Lorenzo Y. |
| author_sort |
Campeña, Francis Joseph H. |
| title |
Fold thickness of some graphs |
| title_short |
Fold thickness of some graphs |
| title_full |
Fold thickness of some graphs |
| title_fullStr |
Fold thickness of some graphs |
| title_full_unstemmed |
Fold thickness of some graphs |
| title_sort |
fold thickness of some graphs |
| publisher |
Animo Repository |
| publishDate |
2009 |
| url |
https://animorepository.dlsu.edu.ph/faculty_research/11219 |
| _version_ |
1781799766638723072 |