Networks

Complete binary trees in folded and enhanced cubes

Journal Article

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.

Related Topics

Related Publications

Related Content

Site Footer

Address:

This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.