Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/17406
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFurtula, Boris-
dc.contributor.authorGutman, Ivan-
dc.date.accessioned2023-03-21T12:00:06Z-
dc.date.available2023-03-21T12:00:06Z-
dc.date.issued2017-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/17406-
dc.description.abstractA graph \(G\) of order \(n\) is said to be borderenergetic if its energy is equal to \(2n-2\) and if \(G\) differs from the complete graph \(K_n\). The first such graph was discovered in 2001, but their systematic study started only in 2015. Until now, the number of borderenergetic graphs of order \(n\) was determined for \(n \leq 11\). We now establish that there exist exactly 572 connected borderenergetic graphs of order 12.en_US
dc.language.isoen_USen_US
dc.relation.ispartofIranian Journal of Mathematical Chemistryen_US
dc.subjectGraph energyen_US
dc.subjectBorderenergetic graphen_US
dc.subjectSpectrum (of graph)en_US
dc.titleBorderenergetic graphs of order 12en_US
dc.typearticleen_US
dc.description.versionPublisheden_US
dc.identifier.doi10.22052/ijmc.2017.87093.1290en_US
dc.type.versionPublishedVersionen_US
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

27

Downloads(s)

7

Files in This Item:
File Description SizeFormat 
paper0126.pdf133.65 kBAdobe PDFThumbnail
View/Open


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