“…In [9], the distance energy of a graph is defined as the sum of the absolute values of the distance eigenvalues. Subsequently, many interesting results were obtained related to distance energy (for example see [1, section 8]) and in particular in [19,21], authors computed the distance energy of complete t-partite graph and moreover, in [21], it was also shown that for fixed value of n and t, the distance energy of complete t-partite graphs on n vertices is maximal for complete split graph S n,t and is minimal for Turán graph T n,t . Later in [12], majorization techniques were used to prove that S n,t and T n,t are also the extremal graphs for which the distance spectral radius of complete t-partite graphs on n vertices that attains its maxima and minima, respectively.…”