On distance Laplacian spectral determination of complete multipartite graphs

B.R. Rakshith and Kinkar Chandra Das

Applied Mathematics and Computation, 2023, vol. 443, issue C

Abstract: The (distance) Laplacian spectrum is said to determine a graph Γ if there is no non-isomorphic graph whose (distance) Laplacian spectra is same as that of Γ. Aouchiche et al. [3] proved that “complete k-partite graph is determined by its distance Laplacian spectrum”. This result is not true. In this paper, we determine the correct result on this. Further motivated by this, the distance Laplacian spectral determination of complete k-partite graph with edge addition is studied and at last it is shown that the graphs whose complements are disconnected and determined by their Laplacian spectra are also determined by their distance Laplacian spectra.

Keywords: Laplacian spectrum; Distance Laplacian spectrum; Diameter (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322008554
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:443:y:2023:i:c:s0096300322008554

DOI: 10.1016/j.amc.2022.127787

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 ().