Laplacian Estrada index of trees
From MaRDI portal
Abstract: Let be a simple graph with vertices and let be the eigenvalues of its Laplacian matrix. The Laplacian Estrada index of a graph is defined as . Using the recent connection between Estrada index of a line graph and Laplacian Estrada index, we prove that the path has minimal, while the star has maximal among trees on vertices. In addition, we find the unique tree with the second maximal Laplacian Estrada index.
Recommendations
Cited in
(18)- On the signless Laplacian Estrada index of cacti
- The many facets of the Estrada indices of graphs and networks
- Extremal graphs for Estrada indices
- Graphs with maximum Laplacian and signless Laplacian Estrada index
- More on Laplacian Estrada indices of trees
- The Laplacian energy and Laplacian Estrada index of random multipartite graphs
- A note on the Laplacian Estrada index of trees
- scientific article; zbMATH DE number 5642609 (Why is no real title available?)
- scientific article; zbMATH DE number 5656452 (Why is no real title available?)
- On Distance Signless Laplacian Estrada Index and Energy of Graphs
- Laplacian coefficients and Zagreb indices of trees
- scientific article; zbMATH DE number 6749557 (Why is no real title available?)
- More on the Estrada indices of trees
- On the Estrada and Laplacian Estrada indices of graphs
- On the distance signless Laplacian Estrada index of graphs
- On Estrada index of trees
- Estrada and L-Estrada Indices of a Graph and Their Relationship with the Number of Spanning Trees
- Sharp lower bounds for the Laplacian Estrada index of graphs
This page was built for publication: Laplacian Estrada index of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3144307)