Determinant of graphs joined by two edges
In this paper we develop a technique to calculate the determinant of the adjacency matrix of a graph that is formed by joining two distinct simple graphs by two additional edges. The choice of the vertices at which the connection is established is an arbitrary and naturally the result is a function...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2014
|
| Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84864138938&partnerID=40&md5=d01a999d6eb9ee4b13390ebd4dc76db8 http://cmuir.cmu.ac.th/handle/6653943832/6814 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| id |
th-cmuir.6653943832-6814 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-68142014-08-30T03:51:16Z Determinant of graphs joined by two edges Sookyang S. Arworn S. Gyurov B. In this paper we develop a technique to calculate the determinant of the adjacency matrix of a graph that is formed by joining two distinct simple graphs by two additional edges. The choice of the vertices at which the connection is established is an arbitrary and naturally the result is a function of the choice, so the technique is useful when the joined graphs are of special types - regular, strongly regular, complete graphs, wheel graphs, paths. In the second half of the paper we apply the technique to find the determinant of cycles joined by two edges and complete graphs joined by two edges. © 2012 by the Mathematical Association of Thailand. All rights reserved. 2014-08-30T03:51:16Z 2014-08-30T03:51:16Z 2012 Article 16860209 http://www.scopus.com/inward/record.url?eid=2-s2.0-84864138938&partnerID=40&md5=d01a999d6eb9ee4b13390ebd4dc76db8 http://cmuir.cmu.ac.th/handle/6653943832/6814 English |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| language |
English |
| description |
In this paper we develop a technique to calculate the determinant of the adjacency matrix of a graph that is formed by joining two distinct simple graphs by two additional edges. The choice of the vertices at which the connection is established is an arbitrary and naturally the result is a function of the choice, so the technique is useful when the joined graphs are of special types - regular, strongly regular, complete graphs, wheel graphs, paths. In the second half of the paper we apply the technique to find the determinant of cycles joined by two edges and complete graphs joined by two edges. © 2012 by the Mathematical Association of Thailand. All rights reserved. |
| format |
Article |
| author |
Sookyang S. Arworn S. Gyurov B. |
| spellingShingle |
Sookyang S. Arworn S. Gyurov B. Determinant of graphs joined by two edges |
| author_facet |
Sookyang S. Arworn S. Gyurov B. |
| author_sort |
Sookyang S. |
| title |
Determinant of graphs joined by two edges |
| title_short |
Determinant of graphs joined by two edges |
| title_full |
Determinant of graphs joined by two edges |
| title_fullStr |
Determinant of graphs joined by two edges |
| title_full_unstemmed |
Determinant of graphs joined by two edges |
| title_sort |
determinant of graphs joined by two edges |
| publishDate |
2014 |
| url |
http://www.scopus.com/inward/record.url?eid=2-s2.0-84864138938&partnerID=40&md5=d01a999d6eb9ee4b13390ebd4dc76db8 http://cmuir.cmu.ac.th/handle/6653943832/6814 |
| _version_ |
1681420684232753152 |