Distance-transitive and distance-regular digraphs
暂无分享,去创建一个
We adopt the definition of a distance-transitive digraph given by Lam. If such a digraph has girth g ≥3 and diameter d , we prove the following results: (1) d=g or g −1 and (2) if d=g , then the digraph is obtained by a known construction from a smaller digraph satisfying d=g −1. Finally we mention an alternative definition of distance transitivity, which in our opinion merits study.
[1] D. G. Higman. Coherent configurations , 1975 .
[2] D. G. Higman. Coherent configurations , 1975 .
[3] Jeff Kahn,et al. Nonexistence of certain distance-transitive digraphs , 1981, J. Comb. Theory, Ser. B.
[4] Clement W. H. Lam,et al. Distance transitive digraphs , 1980, Discret. Math..