Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Henry Martyn Mulder (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: