论文信息 - Distance-regular Graphs with b2=1 and Antipodal Covers - 字舞流文

Distance-regular Graphs with b2=1 and Antipodal Covers

We show that a distance-regular graph of valencyk>2 is antipodal, ifb2=1. This answers Problem (i) on p. 182 of Brouwer, Cohen and Neumaier 4.

Makoto Araya | Akira Hiraki | Aleksandar Jurisic

[1] Ernst Willem Lambeck. A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter d = 3i − 1 with bi = 1 and k > 2 , 1991, Des. Codes Cryptogr..

[2] John Shawe-Taylor,et al. CUBIC DISTANCE-REGULAR GRAPHS , 1986 .

[3] A. Gardiner. Antipodal covering graphs , 1974 .

[4] EW Ernst Lambeck,et al. Contributions to the theory of distance regular graphs , 1990 .

[5] Makoto Araya,et al. Distance-Regular Graphs with bt=1 and Antipodal Double-Covers , 1996, J. Comb. Theory, Ser. B.

[6] A. Neumaier,et al. Distance Regular Graphs , 1989 .