On incidence energy of a graph

✍ Scribed by Ivan Gutman; Dariush Kiani; Maryam Mirzakhah; Bo Zhou

• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 196 KB
• Volume: 431
• Category: Article
• ISSN: 0024-3795
• DOI: 10.1016/j.laa.2009.04.019

✦ Synopsis

Singular value (of matrix) Incidence matrix Laplacian matrix (of graph) Signless Laplacian matrix (of graph)

The Laplacian-energy like invariant LEL(G) and the incidence energy IE(G) of a graph are recently proposed quantities, equal, respectively, to the sum of the square roots of the Laplacian eigenvalues, and the sum of the singular values of the incidence matrix of the graph G. However, IE(G) is closely related with the eigenvalues of the Laplacian and signless Laplacian matrices of G. For bipartite graphs, IE = LEL. We now point out some further relations for IE and LEL: IE can be expressed in terms of eigenvalues of the line graph, whereas LEL in terms of singular values of the incidence matrix of a directed graph. Several lower and upper bounds for IE are obtained, including those that pertain to the line graph of G. In addition, Nordhaus-Gaddum-type results for IE are established.