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...

Full description

Saved in:

Bibliographic Details
Main Authors:	Supot Sookyang, Srichan Arworn, Boyko Gyurov
Format:	Journal
Published:	2018
Subjects:	Mathematics
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

id	th-cmuir.6653943832-51803
record_format	dspace
spelling	th-cmuir.6653943832-518032018-09-04T06:09:25Z Determinant of graphs joined by two edges Supot Sookyang Srichan Arworn Boyko Gyurov Mathematics 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. 2018-09-04T06:09:25Z 2018-09-04T06:09:25Z 2012-04-01 Journal 16860209 2-s2.0-84864138938 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84864138938&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/51803
institution	Chiang Mai University
building	Chiang Mai University Library
country	Thailand
collection	CMU Intellectual Repository
topic	Mathematics
spellingShingle	Mathematics Supot Sookyang Srichan Arworn Boyko Gyurov Determinant of graphs joined by two edges
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	Journal
author	Supot Sookyang Srichan Arworn Boyko Gyurov
author_facet	Supot Sookyang Srichan Arworn Boyko Gyurov
author_sort	Supot Sookyang
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	2018
url	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84864138938&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/51803
_version_	1681423835797127168

Determinant of graphs joined by two edges

Similar Items