Distance-transitive graphs of valency 5, 6 and 7 (Q5903316)

A graph \(\Gamma\) is called distance-transitive (d.t.g.) if for all s its automorphism group Aut(\(\Gamma)\) acts transitively on the set of ordered pairs (x,u) of vertices such that \(d(x,u)=s\). Chronologically the first result in the classification of d.t.g.'s is the characterization of d.t.g.'s of valency \(k=3\) obtained in \textit{N. L. Biggs} and \textit{D. H. Smith}'s paper ''On trivalent graphs'' in Bull. Lond. Math. Soc. 3, 155-158 (1971; Zbl 0217.024). For \(k=4\) the classification was carried out by \textit{D. H. Smith} [J. London Math. Soc., II. Ser. 8, 377-384 (1974; Zbl 0285.05109)]. In this paper we classify the d.t.g.'s of valency \(5\leq k\leq 7\). Some computer calculations were involved in the classification. All graphs except one turn out to be known. The new example is of valency 7, on 990 vertices and with automorphism group containing the nonsplit triple covering of the Mathieu group \(M_{22}\). An independent classification of d.t.g.'s of valency 5 and 6 was obtained without a computer by \textit{A. Gardiner} and \textit{C. E. Praeger} [Proc. Edinb. Math. Soc. II. Ser. 30, 73-81 (1987; see the review below); Ars. Comb. 21A, 195-210 (1986; Zbl 0598.05038)]. Recently A. A. Ivanov and A. V. Ivanov using the methods of the paper under review have classified the d.t.g.'s of valency up to 13. This result will appear in Proc. Montreal Conf. Algebraic Combinatorics (August 1986).