On (distance) signless Laplacian spectra of graphs
From MaRDI portal
Publication:2143825
DOI10.1007/s12190-020-01468-8zbMath1487.05167OpenAlexW3118457715MaRDI QIDQ2143825
B. R. Rakshith, M. A. Sriraj, Kinkar Chandra Das
Publication date: 31 May 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-020-01468-8
Uses Software
Cites Work
- Unnamed Item
- Complete split graph determined by its (signless) Laplacian spectrum
- Characterization of extremal graphs from distance signless Laplacian eigenvalues
- The spectral characterization of butterfly-like graphs
- Two Laplacians for the distance matrix of a graph
- Old and new results on algebraic connectivity of graphs
- Signless Laplacians of finite graphs
- Laplacian matrices of graphs: A survey
- Which graphs are determined by their spectrum?
- Kite graphs determined by their spectra
- On the second largest eigenvalue of the signless Laplacian
- A survey of Nordhaus-Gaddum type relations
- The complements of path and cycle are determined by their distance (signless) Laplacian spectra
- Some results on the bounds of signless Laplacian eigenvalues
- Cospectrality of graphs with respect to distance matrices
- Complete multipartite graphs are determined by their distance spectra
- Some graphs determined by their (signless) Laplacian spectra
- On the distance signless Laplacian of a graph
- On Complementary Graphs
- The fan graph is determined by its signless Laplacian spectrum
- Matrix Analysis
- On the multiplicity of distance signless Laplacian eigenvalues of graphs
- On distance Laplacian and distance signless Laplacian eigenvalues of graphs
- Nordhaus-Gaddum-type result on the second largest signless Laplacian eigenvalue of a graph
- Wiener index of trees: Theory and applications
