Fetching the paper…
Reading the bibliography…
In this paper, we show that for given positive integer C, there are only finitely many distance-regular graphs with valency k at least three, diameter D at least six and k2/k<=C.
Nothing clear enough to list yet.
Nothing clear enough to list yet.
Nothing clear enough to list yet.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…