A relationship between the diameter and the intersection number c2 for a distance-regular graph
Combinatorics
2011-09-13 v1
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.
Keywords
Cite
@article{arxiv.1109.2195,
title = {A relationship between the diameter and the intersection number c2 for a distance-regular graph},
author = {Jack H. Koolen and Jongyook Park},
journal= {arXiv preprint arXiv:1109.2195},
year = {2011}
}