Complete binary trees in folded and enhanced cubes
It is well known that the complete binary tree B-n (n greater than or equal to 3) on 2(n) - 1 vertices is not embeddable into the n-dimensional hypercube. In this article, we describe a recursive technique to embed Bn into the n-dimensional folded and enhanced cubes, if n satisfies certain necessary parity conditions. (C) 2004 Wiley Periodicals, Inc.
binary tree enhanced cube hypercube graph network folded cube embedding