Laplacian Estrada index of trees

From MaRDI portal



Abstract: Let G be a simple graph with n vertices and let mu1geqslantmu2geqslant...geqslantmun−1geqslantmun=0 be the eigenvalues of its Laplacian matrix. The Laplacian Estrada index of a graph G is defined as LEE(G)=sumlimitsi=1nemui. Using the recent connection between Estrada index of a line graph and Laplacian Estrada index, we prove that the path Pn has minimal, while the star Sn has maximal LEE among trees on n vertices. In addition, we find the unique tree with the second maximal Laplacian Estrada index.












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)