Eigenvalues and extremal degrees of graphs

DOI10.1016/j.laa.2006.06.013zbMath1114.05062arXivmath/0605071OpenAlexW2070525487MaRDI QIDQ865434

Vladimir Nikiforov

Publication date: 14 February 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0605071

zbMATH Keywords

quasi-random graphsLaplacianvariational characterizationCourant-Fischer theorem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items

σ-algebras for quasirandom hypergraphs ⋮ Network synchronizability analysis: the theory of subgraphs and complementary graphs ⋮ Network synchronizability analysis: A graph-theoretic approach ⋮ The poset of hypergraph quasirandomness

Cites Work

• Unnamed Item
• Unnamed Item
• Eigenvalues and degree deviation in graphs
• Matrix Analysis
• The Laplacian Spectrum of a Graph II
• Quasi-random graphs