Indexed by：
Abstract：
Let G be a graph of order n . Let lambda(1), lambda(2), ... , lambda(n) be the eigenvalues of the adjacency matrix of G, and let mu(1), mu(2), ... , mu(n) be the eigenvalues of theLaplacian matrix of G. Much studied Estrada index of the graph G is defined as EE = EE (G) = Sigma(n)(i=1) e(lambda i). We define and investigate the Laplacian Estrada index of the graph G, LEE = LEE (G) = Sigma(n)(i=1) e((mu i - 2m/n)). Bounds for LEE are obtained,as well as some relations between LEE and graph Laplacian energy.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS
ISSN： 1452-8630
Year： 2009
Issue： 1
Volume： 3
Page： 147-156
1 . 0 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
Cited Count：
WoS CC Cited Count： 38
SCOPUS Cited Count： 41
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
