Bozkurt, Ş. BurcuGüngör, A. DilekZhou, Bo2020-03-262020-03-262010Bozkurt, Ş. B., Güngör, A. D., Zhou, B., (2010). Note on the Distance Energy of Graphs. Match-Communications in Mathematical and in Computer Chemistry, 64(1), 129-134.0340-6253https://hdl.handle.net/20.500.12395/25104The distance energy of a graph G is defined as the sum of the absolute values of the eigenvalues of the distance matrix of G. In this note, we obtain an upper bound for the:distance energy of any connected graph G. Specially, we present upper bounds for the distance energy of connected graphs of diameter 2 with given numbers of vertices and edges, and unicyclie graphs with odd girth. Additionally, we give also a lower bound for the distance energy of unicyclic graphs with odd girth.eninfo:eu-repo/semantics/openAccessArticle641129134Q1WOS:000281508800012Q1