Abstract
Suppose is a simple graph and
are the eigenvalues of its distance matrix
. The distance Estrada index
of
is defined as the sum of
,
. In this paper, we establish better lower and upper bounds to
for almost all graphs
.
Keywords: