On the multiplicity of distance signless Laplacian eigenvalues of graphs

DOI10.1080/03081087.2019.1578726zbMath1452.05107OpenAlexW2913739287WikidataQ114641282 ScholiaQ114641282MaRDI QIDQ5133408

Shuting Liu, Jie Xue, Jin-Long Shu

Publication date: 13 November 2020

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2019.1578726

zbMATH Keywords

multiplicitycospectralitydistance signless Laplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (2)

On (distance) signless Laplacian spectra of graphs ⋮ On the multiplicity of the least signless Laplacian eigenvalue of a graph

Cites Work

• Characterization of extremal graphs from distance signless Laplacian eigenvalues
• The effect of graft transformations on distance signless Laplacian spectral radius
• Two Laplacians for the distance matrix of a graph
• Proof of conjectures on the distance signless Laplacian eigenvalues of graphs
• Graph functions maximized on a path
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• The complements of path and cycle are determined by their distance (signless) Laplacian spectra
• Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph
• Cospectrality of graphs with respect to distance matrices
• On the distance and distance signless Laplacian spectral radii of bicyclic graphs
• On the distance signless Laplacian of a graph
• On the distance signless Laplacian spectral radius of graphs
• Bounds on the distance signless Laplacian spectral radius in terms of clique number

This page was built for publication: On the multiplicity of distance signless Laplacian eigenvalues of graphs