On distance-regular graphs with fixed valency (Q580374)

Let \(\Gamma\) be a finite distance-regular graph which is not an n-gon, with intersection numbers \(c_ i\), \(a_ i\), \(b_ i\). Then the numer of triples \((c_ i,a_ i,b_ i)\) such that \(c_ i=b_ i\) is bounded by a function of the valency of k. This paper is the first step of a programme to show that the diameter of a distance-regular graph is bounded. The projected steps will deal next with the case \((c_ i,a_ i,b_ i)\neq (1,0,k-1)\), (k-1,0,1) and then \((c_ i,a_ i,b_ i)=(1,0,k-1)\), (k-1,0,1).