New lower bounds for the Estrada and Signless Laplacian Estrada Index of a Graph

Authors Juan L. Aguayo, Juan R. Carmona, Jonnathan Rodríguez

Publication date 9 October 2018

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Abstract: Let

G

be a graph on

n

vertices and

l a m b d a_{1}, l a m b d a_{2}, l d o t s, l a m b d a_{n}

its eigenvalues. The Estrada index of

G

is defined as

E E (G) = s u m_{i = 1}^{n} e^{l a m b d a_{i}} .

In this work, using a different demonstration technique, new lower bounds are obtained for the Estrada index, that depends on the number of vertices, the number of edges and the energy of the graph is given. Moreover, another lower bound for the Estrada index is obtained of an arbitrary non-negative Hermitian matrix are established.

This page was built for publication: New lower bounds for the Estrada and Signless Laplacian Estrada Index of a Graph

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