SEARCH

SEARCH BY CITATION

Keywords:

  • graph;
  • network;
  • hypercube;
  • folded cube;
  • enhanced cube;
  • binary tree;
  • embedding

Abstract

It is well known that the complete binary tree Bn (n ≥ 3) on 2n − 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. © 2004 Wiley Periodicals, Inc.