On local structure of a distance-regular graph of Hamming type
暂无分享,去创建一个
Abstract We shall prove a result about local structures of distance-regular graphs with c 2 = 2, c 3 = 3. This gives a generalization and simple proof of the essential part of Egawa's characterization of the Hamming scheme [ J. Combin. Theory Ser. A 31 (1981), 108–125].
[1] Kazumasa Nomura,et al. A remark on the intersection arrays of distance-regular graphs , 1987, J. Comb. Theory, Ser. B.
[2] Yoshimi Egawa,et al. Characterization of H(n, q) by the Parameters , 1981, J. Comb. Theory, Ser. A.