Bounds For The Distance Estrada Index Of Graphs
From MaRDI portal
Publication:6232810
Abstract: The D-eigenvalues {mu}_1,{mu}_2,...,{mu}_{n} of a connected graph G are the eigenvalues of its distance matrix. The distance Estrada index of G is defined in [15] as DEE=DEE(G)=Sigma_{i=1}^n e^{{mu}_{i}} In this paper, we give better lower bounds for the distance Estrada index of any connected graph as well as some relations between DEE(G) and the distance energy.
This page was built for publication: Bounds For The Distance Estrada Index Of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232810)
