Antipodal distance transitive covers of complete graphs (Q1266355): Difference between revisions

This paper contributes to the effort to determine all finite distance-transitive graphs, focusing on antipodal graphs. A graph \(X\) is antipodal if the graph \(X_d\) is disconnected, where \(X_d\) is a graph on the vertices of \(X\) with two vertices joined by an edge iff they are distance \(d\) apart in X, \(d\) being the diameter of \(X\). A distance-transitive graph \(X\) is either bipartite, antipodal, or \(X_r\) is connected for all \(r\) with \(1 \leq r \leq d\). The authors list all antipodal distance-transitive graphs whose antipodal quotient is complete.