Let G be a graph with n vertices and let ?1, ?2, . . . , ?n be its Laplacian eigenvalues. In some recent works a quantity called Laplacian Estrada index was considered, defined as LEE(G)?n1 e?i. We now establish some further properties of LEE, mainly upper and lower bounds in terms of the number of vertices, number of edges, and the first Zagreb index.
Hamidreza BamdadFirouzeh Ashrafİvan Gutman
İvan GutmanLuis MedinaPamela PizarroMaría Robbiano