A sufficient condition for a bipartite graph to be a cube

In this paper we give a new and self-contained proof of the following theorem: Let G denote some finite connected and bipartite graph. If in addition for any two vertices x,y the subgraph induced on those vertices lying on some geodesic from x to y is antipodal, then G is a hypercube of some dimension