On the multiplicity of the least signless Laplacian eigenvalue of a graph
From MaRDI portal
Publication:2144486
DOI10.1016/j.disc.2022.112940zbMath1496.05102OpenAlexW4297790181MaRDI QIDQ2144486
Dein Wong, Fenglei Tian, Shu-Guang Guo
Publication date: 14 June 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.112940
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Biregular graphs with three eigenvalues
- Hypercubes are determined by their distance spectra
- On graphs with just three distinct eigenvalues
- On regular graphs with four distinct eigenvalues
- Graphs whose normalized Laplacian has three eigenvalues
- The smallest eigenvalue of the signless Laplacian
- Graphs with four distinct Laplacian eigenvalues
- Spectra of graphs
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- Signless Laplacians of finite graphs
- On graphs with three distinct Laplacian eigenvalues
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- Nonregular graphs with three eigenvalues
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- On graphs with three eigenvalues
- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
- On the \(A_\alpha\)-spectra of graphs
- Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
- On the second largest eigenvalue of the signless Laplacian
- On graphs with distance Laplacian spectral radius of multiplicity \(n-3\)
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- On the multiplicities of normalized Laplacian eigenvalues of graphs
- A note on graphs whose signless Laplacian has three distinct eigenvalues
- A characterization of the smallest eigenvalue of a graph
- On Graphs with Three or Four Distinct Normalized Laplacian Eigenvalues
- On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
- On graphs with three distinct signless Laplacian eigenvalues
- On the multiplicity of distance signless Laplacian eigenvalues of graphs
- Graphs with many valencies and few eigenvalues
- GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
This page was built for publication: On the multiplicity of the least signless Laplacian eigenvalue of a graph