Gungor, A. DilekBozkurt, S. Burcu2020-03-262020-03-2620091303-5010https://hdl.handle.net/20.500.12395/23718The D-eigenval ues mu(1),mu(2)...,mu(n) of a connected graph G are the eigen-values of its distance matrix D. In this paper we define and investigate n the distance Estrada index of the graph G as DEE = DEE(G) = Sigma(n)(i=1) e(mu i) and obtain bounds for DEE(G) and some relation between DEE(G) and the distance energy.eninfo:eu-repo/semantics/closedAccessDistance energyDistance Estrada indexBoundArticle383277283Q3WOS:000273870200006Q4