Complete binary trees in folded and enhanced cubes
S.A. Choudum, R. Usha Nandini · Networks · 2004
Abstract It is well known that the complete binary treeBn(n≥ 3) on 2n− 1 vertices is not embeddable into then‐dimensional hypercube. In this article, we describe a recursive technique to embedBninto then‐dimensional folded and enhanced cubes, ifnsatisfies certain necessary parity conditions. © 2004 Wiley Periodicals, Inc.