The complements of path and cycle are determined by their distance (signless) Laplacian spectra
From MaRDI portal
Publication:2001619
DOI10.1016/j.amc.2018.01.034zbMath1427.05142OpenAlexW2791637874MaRDI QIDQ2001619
Jin-Long Shu, Shuting Liu, Jie Xue
Publication date: 10 July 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.01.034
Related Items (8)
Distance Signless Laplacian Eigenvalues, Diameter, and Clique Number ⋮ On (distance) signless Laplacian spectra of graphs ⋮ Distance Laplacian spectral radius of the complements of trees and unicyclic graphs ⋮ On distance Laplacian spectral determination of complete multipartite graphs ⋮ On the multiplicity of distance signless Laplacian eigenvalues of graphs ⋮ On distance signless Laplacian spectrum of the complements of unicyclic graphs and trees ⋮ Matching number, connectivity and eigenvalues of distance signless Laplacians ⋮ On the Dα-spectra of graphs
Cites Work
- Hypercubes are determined by their distance spectra
- Remoteness and distance eigenvalues of a graph
- Two Laplacians for the distance matrix of a graph
- The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
- The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\)
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- The distance spectrum of complements of trees
- On graphs with at least three distance eigenvalues less than \(-1\)
- On the least distance eigenvalue and its applications on the distance spread
- Complete multipartite graphs are determined by their distance spectra
- On the distance spectrum of graphs
- On the second largest distance eigenvalue of a graph
- Graphs with small diameter determined by their $D$-spectra
This page was built for publication: The complements of path and cycle are determined by their distance (signless) Laplacian spectra
