An inequality involving the second largest and smallest eigenvalue of a distance-regular graph

DOI10.1016/j.laa.2010.12.032zbMath1226.05159arXiv1004.1056WikidataQ112882178 ScholiaQ112882178MaRDI QIDQ2431156

Jack H. Koolen, Jongyook Park, Hyonju Yu

Publication date: 11 April 2011

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

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

zbMATH Keywords

distance-regular graph; bounds on eigenvalues; tight distance-regular graph; Shill distance-regular graphs

Mathematics Subject Classification ID

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

15A42: Inequalities involving eigenvalues and eigenvectors

Related Items

A Cheeger inequality of a distance regular graph using Green's function, 2-walk-regular graphs with a small number of vertices compared to the valency, Distance-regular graphs with or at least half the valency, The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\), A note on distance-regular graphs with a small number of vertices compared to the valency, Twice \(Q\)-polynomial distance-regular graphs of diameter 4

Cites Work

• Unnamed Item
• Unnamed Item
• There are only finitely many distance-regular graphs of fixed valency greater than two
• Shilla distance-regular graphs
• The distance-regular graphs of valency four
• Tight distance-regular graphs
• A family of antipodal distance-regular graphs related to the classical Preparata codes
• Interlacing eigenvalues and graphs
• Cubic Distance-Regular Graphs