Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
From MaRDI portal
Publication:5081618
Recommendations
Cites work
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- An introduction to the theory of graph spectra
- Biregular graphs with three eigenvalues
- GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
- scientific article; zbMATH DE number 4114654 (Why is no real title available?)
- Multiplicative cones - a family of three eigenvalue graphs
- Nonregular graphs with three eigenvalues
- On graphs with distance Laplacian spectral radius of multiplicity \(n-3\)
- On graphs with just three distinct eigenvalues
- On graphs with three eigenvalues
- On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach
- On the multiplicity of laplacian eigenvalues of graphs
- On trees with Laplacian eigenvalue one
- Permanental roots and the star degree of a graph
- Regular graphs with four eigenvalues
- Small regular graphs with four eigenvalues
- Spectra of graphs
- The Laplacian Spectrum of a Graph
Cited in
(3)
This page was built for publication: Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5081618)