An incomparable upper bound for the largest Laplacian graph eigenvalue.
From MaRDI portal
Recommendations
Cited in
(13)- A note on Laplacian graph eigenvalues
- An improved upper bound for Laplacian graph eigenvalues
- A decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph.
- An always nontrivial upper bound for Laplacian graph eigenvalues
- A new upper bound for the Laplacian spectral radius of graphs
- Upper bound for the Laplacian graph eigenvalues
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- Several sharp upper bounds for the largest Laplacian eigenvalue of a graph
- scientific article; zbMATH DE number 6383827 (Why is no real title available?)
- The upper bounds for the largest Laplacian eigenvalue of graphs
- Upper bounds on the (signless) Laplacian eigenvalues of graphs
- New upper bound on the largest Laplacian eigenvalue of graphs
- A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs
This page was built for publication: An incomparable upper bound for the largest Laplacian graph eigenvalue.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134384)