Open AccessMore on the Laplacian Estrada index
Author(s) -
Bo Zhou,
Iván Gutman
Publication year - 2009
Publication title -
applicable analysis and discrete mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.69
H-Index - 26
eISSN - 2406-100X
pISSN - 1452-8630
DOI - 10.2298/aadm0902371z
Subject(s) - mathematics , combinatorics , eigenvalues and eigenvectors , laplace operator , index (typography) , graph , laplacian matrix , upper and lower bounds , discrete mathematics , mathematical analysis , physics , quantum mechanics , world wide web , computer science
Let $G$ be a graph with $n$ vertices and let $mu_1,mu_2,ldots,mu_n$ be its Laplacian eigenvalues. In some recent works aquantity called Laplacian Estrada index was considered, defined as$LEE(G)=sumlimits_{i=1}^n e^{mu_i}$,. We now establish somefurther properties of $LEE$, mainly upper and lower bounds interms of the number of vertices, number of edges, and the firstZagreb index
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom