Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching
From MaRDI portal
Publication:6657250
DOI10.1016/J.DAM.2024.11.003MaRDI QIDQ6657250
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Graph reduction techniques and the multiplicity of the Laplacian eigenvalues
- Spectra of graphs
- Hamilton cycles and eigenvalues of graphs
- On the multiplicity of the least signless Laplacian eigenvalue of a graph
- The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching
- The multiplicity of Laplacian eigenvalue two in unicyclic graphs
- A note on graphs whose signless Laplacian has three distinct eigenvalues
This page was built for publication: Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657250)