Edge-symmetric distance-regular covers of cliques: affine case (Q2375964): Difference between revisions

This paper studies edge-symmetric antipodal distance-regular graphs of diameter 3, based on a classification of twice transitive permutation groups. A connected graph \(G\) is distance-regular if for any \(u\) and \(v\) in \(V(G)\) and any integers \(i, j\) in the range of \([0, D(G)],\) where \(D(G)\) is the diameter of \(G,\) the number of vertices at distance \(i\) from \(u\) and distance \(j\) from \(v\) depends only on \(i, j,\) and the distance between \(u\) and \(v,\) but not on choices of \(u\) and \(v\) themselves. Such a graph can be characterized with its intersection array. It is also well known that a graph is edge symmetric if its automorphism group acts transitively on the set of its arcs (ordered edges). The whole paper contains one theorem and its proof. The statement of the theorem itself, together with clarification of all the involved terms, would easily fit in a page. Readers who are interested in this result should consult the paper itself. This paper also contains a corollary of the above theorem, when the involved graph is vertex symmetric and the action of the group on the set of antipodal classes of the graph is affine.