Ş. Burcu Bozkurt, Durmuş Bozkurt
Published 2012-05-06Version 1
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.
On Randomly k-Dimensional Graphs
On (strong) proper vertex-connection of graphs
A partition of connected graphs
![QR code for arXiv:1205.1189 [math.CO]](http://oss.arxitics.com/images/favicon.svg)