Sharp upper bounds on the distance energies of a graph

In this paper, for a simple undirected connected graph, sharp upper bounds on the distance energy, distance Laplacian energy and distance signless Laplacian energy are obtained. The graphs attaining the corresponding upper bound are characterized.