1. CMU Intellectual Repository
  2. Academic Support Units
  3. Chiang Mai University Library
  4. CMUL: Journal Articles
Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/51803
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSupot Sookyangen_US
dc.contributor.authorSrichan Arwornen_US
dc.contributor.authorBoyko Gyuroven_US
dc.date.accessioned2018-09-04T06:09:25Z-
dc.date.available2018-09-04T06:09:25Z-
dc.date.issued2012-04-01en_US
dc.identifier.issn16860209en_US
dc.identifier.other2-s2.0-84864138938en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84864138938&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/51803-
dc.description.abstractIn 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.en_US
dc.subjectMathematicsen_US
dc.titleDeterminant of graphs joined by two edgesen_US
dc.typeJournalen_US
article.title.sourcetitleThai Journal of Mathematicsen_US
article.volume10en_US
article.stream.affiliationsChiang Mai Universityen_US
article.stream.affiliationsUniversity of Arkansas Systemen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.