Distance-regular graphs with valency k having smallest eigenvalue at most -k/2
Abstract
In this paper, we study the non-bipartite distance-regular graphs with valency k and having a smallest eigenvalue at most -k/2.
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.