Copyright © 1995 Published by Elsevier Science B.V.
On the generalized twisted cube
Received 1 December 1995.
Communicated by S.C. Akl
Available online 5 April 2000.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The generalized twisted cube GQn, a variation on hypercubes (Qn) with smaller diameter, was introduced in [1]. In [1], we claimed that the complete binary tree on 2n − 1 nodes (Tn), which is not a subgraph of the Qn, is a subgraph of the GQn. The proof which appeared in [1] is incorrect. This note is intended to (1) support that claim and (2) present an efficient dilation 1 embedding of the N × N mesh of trees, a very powerful network for parallel computation, in the 4N2 — node GQ.
Author Keywords: Parallel processing; Hypercubes; Meshes of trees







E-mail Article
Add to my Quick Links

Cited By in Scopus (3)

8, at least 3
2
diameter twisted cube given by F. Chedid and R. Chedid (1993). We discuss embedding other networks within twisted cubes and point out an error in one supposed embedding given by Chedid and Chedid.



