Upper bound on Randić energy of some graphs

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Gutman, Ivan	-
dc.contributor.author	Robbiano M.	-
dc.contributor.author	San Martin B.	-
dc.date.accessioned	2021-04-20T19:46:46Z	-
dc.date.available	2021-04-20T19:46:46Z	-
dc.date.issued	2015	-
dc.identifier.issn	0024-3795	-
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/12006	-
dc.description.abstract	© 2015 Elsevier Inc. All rights reserved. Applying the Cauchy-Schwarz inequality, we obtain a sharp upper bound on the Randić energy of a bipartite graph and of graphs whose adjacency matrix is partitioned into blocks with constant row sum.	-
dc.rights	restrictedAccess	-
dc.source	Linear Algebra and Its Applications	-
dc.title	Upper bound on Randić energy of some graphs	-
dc.type	article	-
dc.identifier.doi	10.1016/j.laa.2015.03.039	-
dc.identifier.scopus	2-s2.0-84927607359	-
Appears in Collections:	Faculty of Science, Kragujevac

119

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