The distance-regular graphs such that all of its second largest local eigenvalues are at most one

DOI10.1016/j.laa.2011.02.049zbMath1222.05163arXiv1102.4292OpenAlexW2047000549WikidataQ112882181 ScholiaQ112882181MaRDI QIDQ550631

Jack H. Koolen, Hyonju Yu

Publication date: 13 July 2011

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

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

zbMATH Keywords

distance-regular graphline graphgeneralized line graphlocal eigenvalue

Mathematics Subject Classification ID

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

Related Items (6)

Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\) ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Exceptional strongly regular graphs with eigenvalue 3 ⋮ The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\) ⋮ The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one ⋮ Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing distance-regularity of graphs by the spectrum
• Distance-regular graphs with girth 3 or 4: I
• A new feasibility condition for distance-regular graphs
• Line graphs, root systems, and elliptic geometry
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)
• Root systems and the Johnson and Hamming graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3

This page was built for publication: The distance-regular graphs such that all of its second largest local eigenvalues are at most one