Altındağ, Ş. Burcu BozkurtBozkurt, Durmuş2020-03-262020-03-262015978-0-7354-1287-30094-243Xhttps://dx.doi.org/10.1063/1.4912608https://hdl.handle.net/20.500.12395/31899International Conference on Numerical Analysis and Applied Mathematics (ICNAAM) -- SEP 22-28, 2014 -- Rhodes, GREECELet G be simple connected graph with n vertices. The distance eigenvalues mu(1) >= mu(2) >= ... >= mu(n) of G are the eigenvalues of its distance matrix D(G). The distance Estrada index of G is defined as DEE(G) = Sigma(n)(i=1) e(mu) [14]. In this paper, we establish better lower bounds for DEE (G) as well as some relations between DEE(G) and the distance energy.en10.1063/1.4912608info:eu-repo/semantics/closedAccessConference Object1648N/AWOS:000355339702026N/A