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.
|Number of pages||8|
|Journal||MATCH Communications in Mathematical and in Computer Chemistry|
|Publication status||Published - 2011|
Scopus Subject Areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics