On upper bounds for Laplacian graph eigenvalues
From MaRDI portal
Publication:967494
DOI10.1016/J.LAA.2009.12.013zbMATH Open1201.05062OpenAlexW2026774878MaRDI QIDQ967494FDOQ967494
Authors: Dong-Mei Zhu
Publication date: 29 April 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.12.013
Recommendations
- Upper bound for the Laplacian graph eigenvalues
- The upper bounds for the largest Laplacian eigenvalue of graphs
- Upper bounds for the sum of Laplacian eigenvalues of graphs
- Sharp upper bounds for the Laplacian graph eigenvalues
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- An improved upper bound for Laplacian graph eigenvalues
- Bounds for Laplacian graph eigenvalues
- Upper bounds on the (signless) Laplacian eigenvalues of graphs
- An always nontrivial upper bound for Laplacian graph eigenvalues
- Several sharp upper bounds for the largest Laplacian eigenvalue of a graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- A note on Laplacian graph eigenvalues
- Two sharp upper bounds for the Laplacian eigenvalues.
- An always nontrivial upper bound for Laplacian graph eigenvalues
- Eigenvalues of the Laplacian of a graph∗
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
- Bounds on the (Laplacian) spectral radius of graphs
- An improved upper bound for Laplacian graph eigenvalues
- On the Laplacian spectral radius of a graph
- Sharp upper bounds for the Laplacian graph eigenvalues
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- On the Laplacian eigenvalues of a graph
- A new upper bound for the Laplacian spectral radius of graphs
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- The Laplacian eigenvalues of mixed graphs
Cited In (15)
- Bounds on normalized Laplacian eigenvalues of graphs
- Some upper bounds for the signless Laplacian spectral radius of digraphs
- Bounds for the Laplacian spectral radius of graphs
- Several sharp upper bounds for the largest Laplacian eigenvalue of a graph
- Upper bound for the trace norm of the Laplacian matrix of a digraph and normally regular digraphs
- Upper bounds of the eigenvalues related to a weighted fractional \(p\)-Laplacian on metric graphs
- A decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph.
- Laplacian spectral characterization of some graph join
- An incomparable upper bound for the largest Laplacian graph eigenvalue.
- An improved upper bound for Laplacian graph eigenvalues
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- Title not available (Why is that?)
- Upper bound for the Laplacian graph eigenvalues
- Upper bounds for Steklov eigenvalues of subgraphs of polynomial growth Cayley graphs
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
This page was built for publication: On upper bounds for Laplacian graph eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967494)