A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs
From MaRDI portal
Publication:861028
DOI10.1016/j.laa.2006.08.022zbMath1110.05062OpenAlexW2136339442MaRDI QIDQ861028
Publication date: 9 January 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.08.022
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
Convergence to global equilibrium for Fokker-Planck equations on a graph and Talagrand-type inequalities, The spectral radius of maximum weighted cycle, On the spectrum of hypergraphs, On the Laplacian spectral radius of weighted trees with a positive weight set, On the (Laplacian) spectral radius of weighted trees with fixed matching number q and a positive weight set, On the weighted trees with given degree sequence and positive weight set, Cheeger constants, structural balance, and spectral clustering analysis for signed graphs, On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set, Lower bounds on the (Laplacian) spectral radius of weighted graphs, On the Laplacian spectral radius of weighted trees with fixed diameter and weight set, On the spectral radius of weighted unicyclic graphs with a positive weight set
Cites Work
- On the Laplacian eigenvalues of a graph
- Laplacian matrices of graphs: A survey
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- An improved upper bound for Laplacian graph eigenvalues
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- Bounds for sums of eigenvalues and applications
- An always nontrivial upper bound for Laplacian graph eigenvalues
- Abschätzungen für die Eigenwerte positiver linearer Operatoren
- A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
- Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
- Eigenvalues of the Laplacian of a graph∗
- The Laplacian Spectrum of a Graph II
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph