On Laplacian like energy of trees

From MaRDI portal
Publication:2853192

zbMATH Open1289.05295arXiv1103.4814MaRDI QIDQ2853192FDOQ2853192


Authors: Aleksandar Ilić, Đorđe Krtinić, Milovan Ilić Edit this on Wikidata


Publication date: 18 October 2013

Published in: MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Abstract: Let G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplacian matrix L(G), det(lambdaIL(G))=sumk=0n(1)kcklambdank. Laplacian--like energy of a graph is newly proposed graph invariant, defined as the sum of square roots of Laplacian eigenvalues. For bipartite graphs, the Laplacian--like energy coincides with the recently defined incidence energy IE(G) of a graph. In [D. Stevanovi' c, extit{Laplacian--like energy of trees}, MATCH Commun. Math. Comput. Chem. 61 (2009), 407--417.] the author introduced a partial ordering of graphs based on Laplacian coefficients. We point out that original proof was incorrect and illustrate the error on the example using Laplacian Estrada index. Furthermore, we found the inverse of Jacobian matrix with elements representing derivatives of symmetric polynomials of order n, and provide a corrected elementary proof of the fact: Let G and H be two n-vertex graphs; if for Laplacian coefficients holds ck(G)leqslantck(H) for k=1,2,...,n1, then LEL(G)leqslantLEL(H). In addition, we generalize this theorem and provide a necessary condition for functions that satisfy partial ordering based on Laplacian coefficients.


Full work available at URL: https://arxiv.org/abs/1103.4814




Recommendations





Cited In (18)





This page was built for publication: On Laplacian like energy of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2853192)