Path Embedding in Faulty Locally Twisted Cubes.pdf

Yuejuan Han, Jianxi Fan, Jiwen Yang, and Peide Qian School of Computer Science and Technology Soochow University Suzhou, China Email: hyj@ Abstract—As a newly introduced interconnection network for parallel computing, the locally twisted cube possesses many de- sirable properties. In this paper, fault-tolerant embedding of paths in locally twisted cubes is studied. Let LTQn(V,E) denotes the n-dimensional locally twisted cube. We ?nd that, for any faulty set F ? V (LTQn) E(LTQn) with |F|≤ n ? 3 and  with 2n?1 ?1 ≤  ≤|V (LTQn ?F)|?1 for any integer n ≥ 3, a path of length  can be embedded between any two distinct nodes with dilation 1 in LTQn?F. And, the result does not hold if  ≤ 2n?1 ?2 or |F|≥ n ? 2, that is, the two bounds are tight. Moreover, this result extends the known result on (n?3)-Hamiltonian connectivity of LTQn in the literature. Keywords—locally twisted cube, fault-tolerant, path, embedding, dilation, parallel computing system. I. INTRODUCTION Interconnection networks play an important role in paral- lel computing systems. An interconnection network can be represented by a graph G =(V,E), where V represents the node set and E represents the edge set. One of the critical issues in evaluating an interconnection network is how well other existing networks can be embedded into this network. This problem can be modeled by the following graph embedding problem: given a host graph G2 =(V2,E2), which represents the network into which other networks are to be embedded, and a guest graph G1 =(V1,E1), which represents the network to be embedded, the problem is to ?nd a mapping from each node of G1 to a node of G2,