Distance-regular antipodal covering graphs (Q5903862)

Let G be a regular graph with diameter d. G is said to be antipodal if given any distinct vertices u, v, w of G with v and w at distance d from u, then v is distance d from w. G is called distance-regular if for vertices u, v, in G of distance i apart, v is adjacent to \(c_ i\) vertices distance i-1 from u, \(a_ i\) vertices distance i from u, and \(b_ i\) vertices distance \(i+1\) from u and the numbers \(c_ i\), \(a_ i\), \(b_ i\) depend only on i and not on the choice of u and v. The authors present a characterization of distance-regular antipodal coverings of complete bipartite graphs. Using that result, particular classes of such graphs and equivalence to well-known combinatorial structures are noted.