Lower bounds for Estrada index and Laplacian Estrada index

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Bamdad H.	-
dc.contributor.author	Ashraf F.	-
dc.contributor.author	Gutman, Ivan	-
dc.date.accessioned	2021-04-20T14:52:49Z	-
dc.date.available	2021-04-20T14:52:49Z	-
dc.date.issued	2010	-
dc.identifier.issn	0893-9659	-
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/10105	-
dc.description.abstract	Let G be an n-vertex graph. If λ1, λ 2,⋯, λn and μ1, μ 2,⋯, μ n are the ordinary (adjacency) eigenvalues and the Laplacian eigenvalues of G, respectively, then the Estrada index and the Laplacian Estrada index of G are defined as EE (G) = Σni=1 eλi and LEE (G) = Σni=1 eλi, respectively. Some new lower bounds for EE and LEE are obtained and shown to be the best possible. © 2010 Elsevier Ltd. All rights reserved.	-
dc.rights	restrictedAccess	-
dc.source	Applied Mathematics Letters	-
dc.title	Lower bounds for Estrada index and Laplacian Estrada index	-
dc.type	article	-
dc.identifier.doi	10.1016/j.aml.2010.01.025	-
dc.identifier.scopus	2-s2.0-79958848614	-
Appears in Collections:	Faculty of Science, Kragujevac

143

5

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