There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k2/k and large diameter
Combinatorics
2010-12-14 v1
Abstract
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. This extends a conjecture of Bannai and Ito.
Cite
@article{arxiv.1012.2632,
title = {There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k2/k and large diameter},
author = {Jongyook Park and Jack H. Koolen and Greg Markowsky},
journal= {arXiv preprint arXiv:1012.2632},
year = {2010}
}
Comments
12 pages