A relationship between the diameter and the intersection number c2 for a distance-regular graph

2011/09/10 by Koolen, Jack H., Park, Jongyook
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1109.2195

Abstract

In this paper we will look at the relationship between the intersection number c2 and its diameter for a distance-regular graph. And also, we give some tools to show that a distance-regular graph with large c2 is bipartite, and a tool to show that if kD is too small then the distance-regular graph has to be antipodal.

Related

• Distance-regular graph with large a1 or c2
• There exists no distance-regular graph with intersection array\n 56,36,9;1,3,48
• There does not exist a distance-regular graph with intersection array\n 80, 54,12; 1, 6, 60
• There exists no distance-regular graph with intersection array 55,36,11;1,4,45
• Diameter bounds for distance-regular graphs via long-scale Ollivier Ricci curvature