Distance transitive digraphs
โ
Clement W.H. Lam
๐
Article
๐
1980
๐
Elsevier Science
๐
English
โ 980 KB
A digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v) = d(x, y) there is an automorphism w of the digraph such that T(U) = x and T(V) = y. Some examples of distance-transitive digraphs are given in Section 2. Section 3 defines the intersection matrix and gives