n‐cubes and median graphs
- 1 March 1980
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 4 (1) , 107-110
- https://doi.org/10.1002/jgt.3190040112
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.Keywords
This publication has 2 references indexed in Scilit:
- Median graphs and Helly hypergraphsDiscrete Mathematics, 1979
- The structure of median graphsDiscrete Mathematics, 1978