Impossible cube ambiguity present in a Necker cube illustration, in which a cube is drawn with its edges as line segments, and can be interpreted as being in either of two different three-dimensional orientations. An impossible cube is usually rendered as a Necker cube in which the line segments representing the edges have been replaced by what are apparently solid beams. In Escher's print, the top four joints of the cube, and the upper of the two crossings between its beams, match one of the two interpretations of the Necker cube, while the bottom four joints and the bottom crossing match the
Partial cube root vertex "r" for the tree, arbitrarily, and label each vertex "v" with a string of "m" bits that has a 1 in position "i" whenever edge "i" lies on the path from "r" to "v" in "T". For instance, "r" itself will have a label that is all zero bits, its neighbors will have labels with a single 1-bit, etc. Then the Hamming distance between any two labels is the distance between the two vertices in the tree, so this labeling shows that "T" is a partial cube. Every hypercube graph is itself a partial cube, which can be