More on borderenergetic graphs

Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11754

Full metadata record

DC Field	Value	Language
dc.contributor.author	Deng B.	-
dc.contributor.author	Xueliang L.	-
dc.contributor.author	Gutman, Ivan	-
dc.date.accessioned	2021-04-20T19:08:52Z	-
dc.date.available	2021-04-20T19:08:52Z	-
dc.date.issued	2016	-
dc.identifier.issn	0024-3795	-
dc.identifier.uri	https://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.rights	restrictedAccess	-
dc.source	Linear Algebra and Its Applications	-
dc.title	More on borderenergetic graphs	-
dc.type	article	-
dc.identifier.doi	10.1016/j.laa.2016.02.029	-
dc.identifier.scopus	2-s2.0-84960886199	-
Appears in Collections:	Faculty of Science, Kragujevac

121

6

Files in This Item:

File	Description	Size	Format
PaperMissing.pdf Restricted Access		29.86 kB	Adobe PDF	View/Open

SCIDAR - A Digital Archive of the University of Kragujevac