Antipodal Distance-transitive Covers of Complete Bipartite Graphs

This paper completes the classification of antipodal distance-transitive covers of the complete bipartite graphs K k , k , where k > 3 . For such a cover the antipodal blocks must have size r < k . Although the case r 5 k has already been considered , we give a unified treatment of r < k . We use deep group-theoretic results as well as representation… CONTINUE READING