Lower bounds for the Laplacian spectral radius of graphs
From MaRDI portal
Publication:2238865
DOI10.1016/J.LAA.2021.08.026zbMATH Open1477.05101OpenAlexW3197420958MaRDI QIDQ2238865FDOQ2238865
Authors: Yanyan Li 
Publication date: 2 November 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.08.026
Recommendations
Cites Work
- Title not available (Why is that?)
- On the spectral radius of graphs
- Lower bounds of the Laplacian spectrum of graphs based on diameter
- An improved upper bound for Laplacian graph eigenvalues
- Laplace eigenvalues of graphs---a survey
- The largest two Laplacian eigenvalues of a graph
- Bounds on graph eigenvalues. I
- A new upper bound for the Laplacian spectral radius of graphs
- Title not available (Why is that?)
Cited In (12)
- 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
- A sharp lower bound of the spectral radius with application to the energy of a graph
- Lower bounds of the Laplacian spectrum of graphs based on diameter
- Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius
- 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
- Lower bounds for the spectral norm of digraphs
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)
