Embedding Complete Binary Trees into Locally Twisted Cubes

Abstract

Abstract. The locally twisted cube is a newly introduced interconnection network for parallel computing, which possesses many desirable properties. In this paper, the problem of embedding complete binary trees into locally twisted cubes is studied. Let LT Q n (V, E) denote the n-dimensional locally twisted cube. We find the following result in this paper: for any integer n ≥ 2, we show that a complete binary tree with 2 n − 1 nodes can be embedded into the LT Q n with dilation 2.