Improving diameter bounds for distance-regular graphs

https://doi.org/10.1016/j.ejc.2004.07.004Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper we study the sequence (ci)0id for a distance-regular graph. In particular we show that if d2j and cj>1 then c2j1>cj holds. Using this we give improvements on diameter bounds by A. Hiraki, J.H. Koolen [An improvement of the Ivanov bound, Ann. Comb. 2 (2) (1998) 131–135], and L. Pyber [A bound for the diameter of distance-regular graphs, Combinatorica 19 (4) (1999) 549–553], respectively, by applying this inequality.

Cited by (0)