Assertion: graph's vertex | /r/HasProperty | median graph
Facets:
Source sentences:
text: A hypercube graph, in which the vertices correspond to all possible k-bit bitvectors and in which two vertices are adjacent when the corresponding bitvectors differ in only a single bit, is a special case of a k-dimensional grid graph and is therefore a median graph.