An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
Abstract
For a distance-regular graph with second largest eigenvalue (resp. smallest eigenvalue) μ1 (resp. μD) we show that (μ1+1)(μD+1)<= -b1 holds, where equality only holds when the diameter equals two. Using this inequality we study distance-regular graphs with fixed second largest eigenvalue.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.