Premium
n ‐cubes and median graphs
Author(s) -
Mulder Martyn
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040112
Subject(s) - combinatorics , mathematics , shortest path problem , vertex (graph theory) , distance , cube (algebra) , graph , path (computing) , discrete mathematics , computer science , programming language
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom