Sciweavers

EJC
2006
13 years 11 months ago
Improving diameter bounds for distance-regular graphs
In this paper we study the sequence (ci)0id for a distance-regular graph. In particular we show that if d 2j and cj = c > 1 then c2j > c holds. Using this we give improveme...
Sejeong Bang, Akira Hiraki, Jacobus H. Koolen