Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11754
Full metadata record
DC FieldValueLanguage
dc.rights.licenserestrictedAccess-
dc.contributor.authorDeng B.-
dc.contributor.authorXueliang L.-
dc.contributor.authorGutman, Ivan-
dc.date.accessioned2021-04-20T19:08:52Z-
dc.date.available2021-04-20T19:08:52Z-
dc.date.issued2016-
dc.identifier.issn0024-3795-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/11754-
dc.description.abstract© 2016 Elsevier Inc. All rights reserved. The energy E(G) of a graph G is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. If a graph G of order n has the same energy as the complete graph Kn, i.e., if E(G)=2(n-1), then G is said to be borderenergetic. We obtain three asymptotically tight bounds on the edge number of borderenergetic graphs. Then, by using disconnected regular graphs we construct connected non-complete borderenergetic graphs.-
dc.rightsinfo:eu-repo/semantics/restrictedAccess-
dc.sourceLinear Algebra and Its Applications-
dc.titleMore on borderenergetic graphs-
dc.typearticle-
dc.identifier.doi10.1016/j.laa.2016.02.029-
dc.identifier.scopus2-s2.0-84960886199-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

454

Downloads(s)

9

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access
29.86 kBAdobe PDFThumbnail
View/Open


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