most citedThere are only finitely many distance-regular graphs of fixed valency greater than two

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2009★ 2 cited

There are only finitely many distance-regular graphs of fixed valency greater than two

S. Bang, A. Dubickas, J. H. Koolen +1

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.

math.CO2009

On Distance-Regular Graphs with Smallest Eigenvalue at Least

J. H. Koolen, S. Bang

A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fi…