A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
From MaRDI portal
Publication:1611839
DOI10.1016/S0024-3795(01)00548-1zbMath0999.05073OpenAlexW2041336047MaRDI QIDQ1611839
Yuan Hong, Jin-Long Shu, Wen-Ren Kai
Publication date: 28 August 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(01)00548-1
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)
Related Items
Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs, Some more interplay of the three Kirchhoffian indices, Bounds on graph eigenvalues. I, Minimizing the Laplacian eigenvalues for trees with given domination number, Classification of trees by Laplacian eigenvalue distribution and edge covering number, Some graft transformations and its applications on the distance spectral radius of a graph, On the Laplacian spectral radius of a graph, Two sharp upper bounds for the Laplacian eigenvalues., Q-integral unicyclic, bicyclic and tricyclic graphs, On the spectral radius of graphs, The Laplacian spectral radii of trees with degree sequences, Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs, Several sharp upper bounds for the largest Laplacian eigenvalue of a graph, Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees, Signless Laplacian spectral radii of graphs with given chromatic number, Bounds for the Laplacian spectral radius of graphs, On the signless Laplacian spectral radius of graphs with cut vertices, A new upper bound for the Laplacian spectral radius of graphs, On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs, Chromatic number and spectral radius, Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph, Lower bounds on the (Laplacian) spectral radius of weighted graphs, An edge-grafting theorem on Laplacian spectra of graphs and its application, Maximizing the Laplacian spectral radii of graphs with given diameter, An improved upper bound for the Laplacian spectral radius of graphs, Minimizing the Laplacian spectral radius of trees with given matching number, Bounds for the Laplacian spectral radius of graphs, Bounding the largest eigenvalue of trees in terms of the largest vertex degree
Cites Work
