There are only finitely many distance-regular graphs of fixed valency greater than two
classification
🧮 math.CO
keywords
distance-regularfinitelyfixedgraphsgreatermanyonlythere
read the original abstract
In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.
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.