Improved upper bounds for the Laplacian spectral radius of a graph
From MaRDI portal
Publication:625408
Summary: We present three improved upper bounds for the Laplacian spectral radius of graphs. Moreover, we determine all extremal graphs which achieve these upper bounds. Finally, some examples illustrate that the results are best in all known upper bounds in some sense.
Recommendations
- Several classes of upper bounds for the Laplacian spectral radius of a graph
- The Laplacian spectral radius of graphs
- An improved upper bound for the Laplacian spectral radius of graphs
- Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs
- scientific article; zbMATH DE number 5003617
Cited in
(10)- An improved upper bound for the Laplacian spectral radius of graphs
- Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs
- A note on the upper bounds for the Laplacian spectral radius of graphs
- Sharp bounds for the signless Laplacian spectral radius of digraphs
- The Laplacian spectral radius of graphs
- Several classes of upper bounds for the Laplacian spectral radius of a graph
- scientific article; zbMATH DE number 1279785 (Why is no real title available?)
- Upper bounds of Laplacian spectral radius for the Cartesian product graphs
- Some upper bounds for the signless Laplacian spectral radius of digraphs
- Bounds for the Laplacian spectral radius of graphs
This page was built for publication: Improved upper bounds for the Laplacian spectral radius of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625408)