HyperCube
If a system has 2N elements, each element has N connections to other elements. Each element is connected to its ‘boolean’ neighbor (Node number differs by only one bit).
Does not scale well with N.
Has good nearest neighbor connectivity.
Longest # of hops between nodes = N.