Abstract
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) =. 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.
Author supplied keywords
Cite
CITATION STYLE
APA
Zhou, B., & Gutman, I. (2009). More on the laplacian estrada index. Applicable Analysis and Discrete Mathematics, 3(2), 371–378. https://doi.org/10.2298/AADM0902371Z
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free