Effects on distance energy of complete bipartite graphs by embedding edges

Zhiwen Wang and Xianhao Meng

Applied Mathematics and Computation, 2022, vol. 430, issue C

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.

Keywords: Distance energy; Complete bipartite graph; Edge (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322003496
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:430:y:2022:i:c:s0096300322003496

DOI: 10.1016/j.amc.2022.127275

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().