2000 character limit reached
The distance-regular graphs such that all of its second largest local eigenvalues are at most one
Published 21 Feb 2011 in math.CO | (1102.4292v1)
Abstract: In this paper, we classify distance regular graphs such that all of its second largest local eigenvalues are at most one. Also we discuss the consequences for the smallest eigenvalue of a distance-regular graph. These extend a result by the first author, who classified the distance-regular graph with smallest eigenvalue $-1-\frac{b_1}{2}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.