The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
Some results on topological properties of folded hypercubes
Information Processing Letters
A performance guaranteed new algorithm for fault-tolerant routing in folded cubes
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
The structural features of enhanced hypercube networks
ICNC'09 Proceedings of the 5th international conference on Natural computation
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
Discrete Applied Mathematics
Wirelength of hypercubes into certain trees
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.