Answers are grounded in this paper and cite their sources.
This paper represents the first step in the classification of finite primitive distance transitive graphs. In it we reduce the problem to the case where the automorphism group is either almost simple or affine. Let ^ be a simple, connected, undirected graph with vertex set Q. If oc, /? e Q,
No takes yet. Share an insight, caveat, or question.
Praeger et al. (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: