Effects on distance energy of complete bipartite graphs by embedding edges

Abstract

The distance energy of a connected graph G is defined to be E(G)=∑i=1n|λi(G)|, where λ1(G),…,λ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.