Lower bounds for the Laplacian spectral radius of graphs
From MaRDI portal
(Redirected from Publication:2238865)
Recommendations
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1833074 (Why is no real title available?)
- A new upper bound for the Laplacian spectral radius of graphs
- An improved upper bound for Laplacian graph eigenvalues
- Bounds on graph eigenvalues. I
- Laplace eigenvalues of graphs---a survey
- Lower bounds of the Laplacian spectrum of graphs based on diameter
- On the spectral radius of graphs
- The largest two Laplacian eigenvalues of a graph
Cited in
(12)- Lower bounds for the spectral norm of digraphs
- A Spectral Lower Bound for the Divisorial Gonality of Metric Graphs
- Bounds for the Laplacian spectral radius of graphs
- Lower bounds on the differential of a graph
- New proofs for two upper bounds on the Laplacian spectral radius of graphs
- Lower bounds of the Laplacian spectrum of graphs based on diameter
- Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius
- A sharp lower bound of the spectral radius with application to the energy of a graph
- On the Laplacian spectral radius of a graph
- Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of fractional matching number
- On estimating a lower bound for the Laplacian spectral radius of triangle-free graphs
- A note on (signless) Laplacian spectral ordering with maximum degrees of graphs
This page was built for publication: Lower bounds for the Laplacian spectral radius of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238865)
