Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 430, Issue -, Pages -Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2022.127275
Keywords
Distance energy; Complete bipartite graph; Edge
Categories
Funding
- Natural Science Foundation of Tianjin [20JCZDJC00840, 20JCJQJC00 090]
- Fundamental Research Funds for the Central Universities, Nankai University
Ask authors/readers for more resources
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.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available