Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- 61 Downloads
Two Hamiltonian paths are said to be fully independent if the ith vertices of both paths are distinct for all i between 1 and n, where n is the number of vertices of the given graph. Hamiltonian paths in a set are said to be mutually fully independent if two arbitrary Hamiltonian paths in the set are fully independent. On the other hand, two Hamiltonian cycles are independent starting at v if both cycles start at a common vertex v and the ith vertices of both cycles are distinct for all i between 2 and n. Hamiltonian cycles in a set are said to be mutually independent starting at v if any two different cycles in the set are independent starting at v. The n-dimensional hypercube is widely used as the architecture for parallel machines. In this paper, we study its fault-tolerant property and show that an n-dimensional hypercube with at most n−2 faulty edges can embed a set of fault-free mutually fully independent Hamiltonian paths between two adjacent vertices, and can embed a set of fault-free mutually independent Hamiltonian cycles starting at a given vertex. The number of tolerable faulty edges is optimal with respect to a worst case.
KeywordsFault-tolerant embedding Graph-theoretic interconnection networks Hamiltonian Hypercubes Mutually independent Hamiltonian cycles
Unable to display preview. Download preview PDF.
- Akers SB, Harel D, Krishnamurthy B (1987) The star graph: an attractive alternative to the n-cube. In: Proceedings of international conference on parallel processing St. Charles, IL, pp 555–556Google Scholar
- Akl SG (1997) Parallel computation: models and methods. Prentice Hall, NJGoogle Scholar
- Ascheuer N (1995) Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. Ph.D. Thesis, University of Technology, Berlin, Germany (also available from 〈ftp://ftp.zib.de/pub/zib-publications/reports/TR-96-03.ps〉)Google Scholar
- Bermond JC (ed) (1992) Interconnection networks a special issue of discrete applied mathematics, vol 37– 38Google Scholar
- Bhuyan L, Agrawal DP (1984) Generalized hypercubes and hyperbus structure for a computer network. IEEE Trans Comput 33:323–333Google Scholar
- Hsu DF (1993) Interconnection networks and algorithms. A special issue of Networks 23(4)Google Scholar
- Leighton FT (1992) Introduction to parallel algorithms and architecture: arrays ⋅ trees ⋅ hypercubes. Morgan Kaufmann, San Mateo, CAGoogle Scholar
- West DB (2001) Introduction to graph theory. Prentice-Hall, Upper Saddle River, NJ 07458Google Scholar
- Xu JM (2001) Topological structure and analysis of interconnection networks. Kluwer academic publishersGoogle Scholar