Effects on distance energy of complete bipartite graphs by embedding edges

The distance energy of a connected graph G is defined to be E(G) = Sigma(n)(i=1) vertical bar lambda(i)(G)vertical bar, where lambda(1)(G), ..., lambda(n)(G) are distance eigenvalues of G. Recently, much research has explored the change of distance energy of a complete multipartite graph by deleting an edge. In this paper, we investigate the effect of distance energy of a complete bipartite graph by embedding some edges. An analogous result on a complete multipartite graph also holds. (C) 2022 Elsevier Inc. All rights reserved.

Automated summary

This paper investigates the effect of embedding edges on the distance energy of a complete bipartite graph and compares it with a complete multipartite graph.