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

DOI10.1016/j.laa.2010.12.032zbMath1226.05159arXiv1004.1056OpenAlexW2082381279WikidataQ112882178 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 graphbounds on eigenvaluestight distance-regular graphShill distance-regular graphs

Mathematics Subject Classification ID

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

Related Items (14)

Twice \(Q\)-polynomial distance-regular graphs of diameter 4 ⋮ On bounding the diameter of a distance-regular graph ⋮ Distance-regular graphs with small number of distinct distance eigenvalues ⋮ Distance-regular Shilla graphs with \(b_2 = c_2\) ⋮ A Cheeger inequality of a distance regular graph using Green's function ⋮ Distance-regular graphs with a few \(q\)-distance eigenvalues ⋮ A note on distance-regular graphs with a small number of vertices compared to the valency ⋮ Distance-regular graphs with or at least half the valency ⋮ 2-walk-regular graphs with a small number of vertices compared to the valency ⋮ Unnamed Item ⋮ Codes in Shilla distance-regular graphs ⋮ The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\) ⋮ Distance-regular graphs without 4-claws ⋮ Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue

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

This page was built for publication: An inequality involving the second largest and smallest eigenvalue of a distance-regular graph