Sciweavers

COMBINATORICS
2000
138views more  COMBINATORICS 2000»
13 years 11 months ago
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs
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...
Miguel Angel Fiol
EJC
2008
13 years 11 months ago
3-bounded property in a triangle-free distance-regular graph
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...
Yeh-jong Pan, Chih-wen Weng