COMBINATORICS
2000
13 years 4 months ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
EJC
2008
13 years 4 months ago
2008
Let denote a distance-regular graph with classical parameters (D, b, , ) and D 3. Assume the intersection numbers a1 = 0 and a2 = 0. We show is 3-bounded in the sense of the ar...