Estimating the distance Estrada index
  Suppose $G$ is a simple graph on $n$ vertices. The $D$-eigenvalues $\mu_1,\mu_2,\cdots,\mu_n$ of $G$ are the eigenvalues of its distance matrix. The distance Estrada index of $G$ is defined as $DEE(G)=\sum_{i=1}^ne^{\mu_i}$. In this paper, we establish new lower and upper bounds for $DEE(G)$ in terms of the Wiener index $W(G)$. We also compute the distance Estrada index for some concrete graphs including the buckminsterfullerene $C_{60}$. 
Yilun Shang
math.CO