On the integrability of strongly regular graphs
Abstract
Koolen et al. showed that if a connected graph with smallest eigenvalue at least -3 has large minimal valency, then it is 2-integrable. In this paper, we will prove that a lower bound for the minimal valency is 166.
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.