Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
- 5 March 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 18 (4) , 511-521
Abstract
Twisted cubes are variants of hypercubes. In this paper, we study the optimal embeddings of paths of all possible lengths between two arbitrary distinct nodes in twisted cubes. We use TQn to denote the n-dimensional twisted cube and use dist(TQn, u, v) to denote the distance between two nodes u and v in TQn, where n ges l is an odd integer. The original contributions of this paper are as follows: 1) We prove that a path of length l can be embedded between u and v with dilation 1 for any two distinct nodes u and v and any integer l with dist(TQn, u, v) + 2 les l les 2n - 1 (n ges 3) and 2) we find that there exist two nodes u and v such that no path of length dist(TQn, u, v) + l can be embedded between u and v with dilation 1 (n ges 3). The special cases for the nonexistence and existence of embeddings of paths between nodes u and v and with length dist(TQn, u, v) + 1 are also discussed. The embeddings discussed in this paper are optimal in the sense that they have dilation 1Keywords
This publication has 20 references indexed in Scilit:
- The t/k-diagnosability of the BC graphsIEEE Transactions on Computers, 2005
- Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphsIEEE Transactions on Computers, 2004
- Fast sorting algorithms on a linear array with a reconfigurable pipelined bus systemIEEE Transactions on Parallel and Distributed Systems, 2002
- Fault-Tolerant Hamiltonicity of Twisted CubesJournal of Parallel and Distributed Computing, 2002
- Topological properties of twisted cubeInformation Sciences, 1999
- Diagnosability of the Mobius cubesIEEE Transactions on Parallel and Distributed Systems, 1998
- The linear-array problem in communication complexity resolved1997
- Embedding binary trees into crossed cubesIEEE Transactions on Computers, 1995
- Embedding graphs onto the SupercubeIEEE Transactions on Computers, 1995
- The twisted cube topology for multiprocessors: A study in network asymmetryJournal of Parallel and Distributed Computing, 1991