Incrementally extensible hypercube (IEH) graphs

The authors propose a new family of interconnection topology that can be used to design communication architectures for distributed systems with an arbitrary number of computing nodes. The design is based on a novel generalization of the well-known hypercube graphs. The proposed topology is shown to be incrementally extensible in steps of 1 and to be optimally fault tolerant, and its diameter is logarithmic in the number of nodes. For any given number of nodes, the difference of the maximum and the minimum degree of a node in the graph is >