Gungor, A. DilekBozkurt, S. Burca2020-03-262020-03-2620110308-1087https://dx.doi.org/10.1080/03081080903503678https://hdl.handle.net/20.500.12395/26693The D-eigenvalues {mu(1), mu(2), ... , mu(p)} of a connected graph G are the eigenvalues of its distance matrix D. The D-energy of a graph G is the sum of the absolute values of its D-eigenvalues denoted by E(D)(G). In this article, we obtain a lower bound for the largest D-eigenvalue of G and an upper bound for E(D)(G) which improve Indulal's bounds [G. Indulal, Sharp bounds on the distance spectral radius and the distance energy of graphs, Linear Algebra Appl. 430 (2009), pp. 106-113]. In the final section of the article, we give an important remark on the distance regular graphs.en10.1080/03081080903503678info:eu-repo/semantics/closedAccessdistance spectral radiusdistance energyArticle594365370Q2WOS:000289775100002Q2