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: | Supot Sookyang, Srichan Arworn, Boyko Gyurov |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84864138938&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/51803 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Determinant of graphs joined by two edges
by: Sookyang S., et al.
Published: (2014) -
Partially composed property of generalized lexicographic product graphs
by: Nopparat Pleanmani, et al.
Published: (2018) -
The dimension of the join of two graphs
by: Gervacio, Severino V., et al.
Published: (2005) -
Partially composed property of generalized lexicographic product graphs
by: Nopparat Pleanmani, et al.
Published: (2018) -
The endomorphism monoids of (n − 3)-regular graphs of order n
by: Nirutt Pipattanajinda, et al.
Published: (2018)