On distance Laplacian spectral determination of complete multipartite graphs
From MaRDI portal
Publication:2700427
DOI10.1016/j.amc.2022.127787OpenAlexW4312222141MaRDI QIDQ2700427
B. R. Rakshith, Kinkar Chandra Das
Publication date: 21 April 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2022.127787
Cites Work
- Complete split graph determined by its (signless) Laplacian spectrum
- Two Laplacians for the distance matrix of a graph
- Old and new results on algebraic connectivity of graphs
- Laplacian matrices of graphs: A survey
- On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
- The complements of path and cycle are determined by their distance (signless) Laplacian spectra
- Cospectrality of graphs with respect to distance matrices
- Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs
- On the conjecture for certain Laplacian integral spectrum of graphs
- Disjoint unions of complete graphs characterized by their Laplacian spectrum
- On distance Laplacian and distance signless Laplacian eigenvalues of graphs
This page was built for publication: On distance Laplacian spectral determination of complete multipartite graphs
