A decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph.
From MaRDI portal
Publication:1430375
DOI10.1016/j.laa.2003.10.026zbMath1038.05039OpenAlexW2064712732MaRDI QIDQ1430375
Publication date: 27 May 2004
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/175015
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities for sums, series and integrals (26D15)
Related Items
Upper bounds and lower bounds for the spectral radius of reciprocal distance, reciprocal distance Laplacian and reciprocal distance signless Laplacian matrices, New bounds on the distance Laplacian and distance signless Laplacian spectral radii, Sharp upper bounds on the distance energies of a graph, Inequalities involving the mean and the standard deviation of nonnegative real numbers
Cites Work
- A note on Laplacian graph eigenvalues
- On the Laplacian eigenvalues of a graph
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- An improved upper bound for Laplacian graph eigenvalues
- Bounds for sums of eigenvalues and applications
- An always nontrivial upper bound for Laplacian graph eigenvalues
- An upper bound on the sum of squares of degrees in a graph
- Eigenvalues of the Laplacian of a graph∗
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
