TY - JOUR
T1 - Note on the laplacian estrada index of a graph
AU - Li, Jianxi
AU - Shiu, Wai Chee
AU - Chan, Wai Hong
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2011
Y1 - 2011
N2 - Let G be a simple graph of order n with m edges. The Laplacian Estrada index of G is defined as LEE = LEE(G) = nΣ i=1 e (μi-2m/n), where μ 1, μ 2, . . . , μ n are the Laplacian eigenvalues of G. In this note, we present two sharp lower bounds for LEE and characterize the graphs for which the bounds are attained.
AB - Let G be a simple graph of order n with m edges. The Laplacian Estrada index of G is defined as LEE = LEE(G) = nΣ i=1 e (μi-2m/n), where μ 1, μ 2, . . . , μ n are the Laplacian eigenvalues of G. In this note, we present two sharp lower bounds for LEE and characterize the graphs for which the bounds are attained.
UR - https://match.pmf.kg.ac.rs/content66n3.htm
UR - http://www.scopus.com/inward/record.url?scp=79958824753&partnerID=8YFLogxK
M3 - Journal article
AN - SCOPUS:79958824753
SN - 0340-6253
VL - 66
SP - 777
EP - 784
JO - MATCH Communications in Mathematical and in Computer Chemistry
JF - MATCH Communications in Mathematical and in Computer Chemistry
IS - 3
ER -