On the integrability of strongly regular graphs
classification
🧮 math.CO
keywords
minimalvalencyboundconnectedeigenvaluegraphgraphsintegrability
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.