1980/03/01 by Henry Martyn Mulder · 80 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Interconnection Networks and Systems #Graph Labeling and Dimension Problems #Combinatorics #Mathematics #Shortest path problem #Vertex (graph theory) #Distance #Cube (algebra) #Graph #Path (computing) #Discrete mathematics #Computer science
paper · doi:10.1002/jgt.3190040112
published in Journal of Graph Theory 4(1), 107-110 (Wiley)
openalex publication_date 1980/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
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.