Abstract
In this paper we will look at the relationship between the intersection number c 2 and the diameter of a distance-regular graph. We also give some tools to show that a distance-regular graph with large c 2 is bipartite, and a tool to show that if k D is too small then the distance-regular graph has to be antipodal.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have