N-cubes and Median Graphs

The n-cube is characterized as a connected regular graph in which for any three vertices u, v, and w there is a unique vertex that lies simultaneously on a shortest (u, v)-path, a shortest (v, w)-path, and a shortest (w, u)-path.