n‐cubes and median graphs
Henry Martyn Mulder · Journal of Graph Theory · 1980
Abstract 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.