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

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