EMBEDDING BINARY-TREES INTO CROSSED CUBES

The recently introduced interconnection network, crossed cube, has att racted much attention in the parallel processing area due to its many attractive features, Like the ordinary hypercube, the n-dimensional cr ossed cube is a regular graph with 2'' vertices and n2(n-1) edges, The diameter of the crossed cube is approximately half that of the ordina ry hypercube, These advantages of the crossed cube motivated the study of how well it can simulate other networks such as the complete binar y tree, In this paper, we show that the (2(n) - 1)-node complete binar y tree can be embedded into the n-dimensional crossed cube with dilati on 1.