The largest two Laplacian eigenvalues of a graph

DOI10.1080/03081080310001649565MaRDI QIDQ4655435zbMATH OpenOpenAlexFDO

Authors Kinkar Ch. Das

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

zbMATH Keywords

Laplacian matrixlargest eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• An improved upper bound for Laplacian graph eigenvalues
• The Laplacian Spectrum of a Graph II

Cited in

(11)

• 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
• Upper bounds on the (signless) Laplacian eigenvalues of graphs
• On the bounds for the largest Laplacian eigenvalues of weighted graphs
• Bounds for the Laplacian spectral radius of graphs
• Bounds for the Laplacian spectral radius of graphs
• Unified understanding and new results of controllability model of multi‐agent systems
• Interconnection topologies for multi-agent coordination under leader-follower framework

This page was built for publication: The largest two Laplacian eigenvalues of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4655435)