On the bounds for the largest Laplacian eigenvalues of weighted graphs
From MaRDI portal
Publication:448971
DOI10.1016/j.disopt.2012.03.001zbMath1247.05143MaRDI QIDQ448971
Şerife Büyükköse, Sezer Sorgun
Publication date: 11 September 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2012.03.001
Related Items
Bounds for the largest Laplacian eigenvalue of weighted graphs, On the signless Laplacian spectral radius of weighted digraphs, The inertia of weighted unicyclic graphs, Some Nordhaus-Gaddum type results of \(A_\alpha \)-eigenvalues of weighted graphs
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
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- Sharp lower bounds on the Laplacian eigenvalues of trees
- Sharp upper bounds for the Laplacian graph eigenvalues
- Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs
- A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
- Matrix Analysis
- Eigenvalues of the Laplacian of a graph∗
- The Laplacian Spectrum of a Graph II
- The largest two Laplacian eigenvalues of a graph
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph