Reconfiguration of complete binary trees in full IEH graphs and faulty hypercubes

The incrementally extensible hypercube (IEH) graph is a generalization of binary hypercube networks in that the number of nodes can be arbitrary in contrast to a strict power of 2. In this paper, the authors present an efficient model to fulfill the embedding of a full binary tree into a full IEH graph. As the model the authors proposed, an algorithm is developed for the embedding with expansion 1, load 1, congestion 2, and dilation 2. Moreover, the embedding algorithm can be also applied into hypercubes with one faulty node.