Bounds For The Distance Estrada Index Of Graphs
Combinatorics
2012-05-08 v1 Spectral Theory
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.
Cite
@article{arxiv.1205.1189,
title = {Bounds For The Distance Estrada Index Of Graphs},
author = {Ş. Burcu Bozkurt and Durmuş Bozkurt},
journal= {arXiv preprint arXiv:1205.1189},
year = {2012}
}