A relationship between the diameter and the intersection number c 2 for a distance-regular graph
- 148 Downloads
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.
KeywordsDistance-regular graphs Intersection numbers Hadamard graphs Hypercubes Diameter
Mathematics Subject Classification (2000)05E30
Unable to display preview. Download preview PDF.