The largest two Laplacian eigenvalues of a graph
From MaRDI portal
Publication:4655435
DOI10.1080/03081080310001649565zbMath1062.05089OpenAlexW2022806502MaRDI QIDQ4655435
Publication date: 11 March 2005
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081080310001649565
Related Items (11)
Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs ⋮ Upper bounds on the (signless) Laplacian eigenvalues of graphs ⋮ Unified understanding and new results of controllability model of multi‐agent systems ⋮ On the bounds for the largest Laplacian eigenvalues of weighted graphs ⋮ Lower bounds for the Laplacian spectral radius of graphs ⋮ Interconnection topologies for multi-agent coordination under leader-follower framework ⋮ Bounds for the Laplacian spectral radius of graphs ⋮ The minimum Laplacian spread of unicyclic graphs ⋮ A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs ⋮ Open problem on \(\sigma\)-invariant ⋮ Bounds for the Laplacian spectral radius of graphs
Cites Work
This page was built for publication: The largest two Laplacian eigenvalues of a graph