The largest two Laplacian eigenvalues of a graph
From MaRDI portal
Publication:4655435
DOI10.1080/03081080310001649565zbMath1062.05089MaRDI 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
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Bounds for the Laplacian spectral radius of graphs, Bounds for the Laplacian spectral radius of graphs, Upper bounds on the (signless) Laplacian eigenvalues of graphs, On the bounds for the largest Laplacian eigenvalues of weighted graphs, Interconnection topologies for multi-agent coordination under leader-follower framework, The minimum Laplacian spread of unicyclic graphs, Lower bounds for the Laplacian spectral radius of graphs, Open problem on \(\sigma\)-invariant, 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
Cites Work