| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654881 | European Journal of Combinatorics | 2007 | 12 Pages |
Abstract
We show several inequalities for intersection numbers of distance-regular graphs. As an application of them we characterize the Odd graphs and the doubled Odd graphs with a few of their intersection numbers. In particular, we prove that the diameter dd of a bipartite distance-regular graph of valency kk and girth 2r+2≥62r+2≥6 is bounded by d≤[k+22]r+1 if it is not the doubled Odd graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Akira Hiraki,