Abstract
A Hamiltonian path in G is a path which contains every vertex of G exactly once. Two Hamiltonian paths P 1=〈u 1,u 2,…,u n 〉 and P 2=〈v 1,v 2,…,v n 〉 of G are said to be independent if u 1=v 1, u n =v n , and u i ≠v i for all 1<i<n; and both are full-independent if u i ≠v i for all 1≤i≤n. Moreover, P 1 and P 2 are independent starting at u 1, if u 1=v 1 and u i ≠v i for all 1<i≤n. A set of Hamiltonian paths {P 1,P 2,…,P k } of G are pairwise independent (respectively, pairwise full-independent, pairwise independent starting at u 1) if any two different Hamiltonian paths in the set are independent (respectively, full-independent, independent starting at u 1). A bipartite graph G is Hamiltonian-laceable if there exists a Hamiltonian path between any two vertices from different partite sets. It is well known that an n-dimensional hypercube Q n is bipartite with two partite sets of equal size. Let F be the set of faulty edges of Q n . In this paper, we show the following results:
-
1.
When |F|≤n−4, Q n −F−{x,y} remains Hamiltonian-laceable, where x and y are any two vertices from different partite sets and n≥4.
-
2.
When |F|≤n−2, Q n −F contains (n−|F|−1)-pairwise full-independent Hamiltonian paths between n−|F|−1 pairs of adjacent vertices, where n≥2.
-
3.
When |F|≤n−2, Q n −F contains (n−|F|−1)-pairwise independent Hamiltonian paths starting at any vertex v in a partite set to n−|F|−1 distinct vertices in the other partite set, where n≥2.
-
4.
When 1≤|F|≤n−2, Q n −F contains (n−|F|−1)-pairwise independent Hamiltonian paths between any two vertices from different partite sets, where n≥3.
Similar content being viewed by others
References
Akl, S.G.: Parallel Computation: Models and Methods. Prentice-Hall, Englewood Cliffs (1997)
Ascheuer, N.: Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. Ph.D. thesis, University of Technology, Berlin, Germany (1995); also available from 〈ftp://ftp.zib.de/pub/zib-publications/reports/TR-96-03.ps〉
Bermond, J.C. (ed.): Interconnection Networks. A special issue of Discrete Appl. Math. 37–38 (1992)
Bhuyan, L., Agrawal, D.P.: Generalized hypercubes and hyperbus structure for a computer network. IEEE Trans. Comput. 33, 323–333 (1984)
Bruck, J., Cypher, R., Soroker, D.: Embedding cube-connected-cycles graphs into faulty hypercubes. IEEE Trans. Comput. 43(10), 1210–1220 (1994)
Hsieh, S.Y.: Embedding longest fault-free paths onto star graphs with more vertex faults. Theor. Comput. Sci. 337(1–3), 370–378 (2005)
Hsieh, S.Y., Chen, C.-H.: Pancyclicity on Möbius cubes with maximal edge faults. Parallel Comput. 30(3), 407–421 (2004)
Hsieh, S.Y., Chen, G.H., Ho, C.W.: Fault-free Hamiltonian cycles in faulty arrangement graphs. IEEE Trans. Parallel Distributed Syst. 10(32), 223–237 (1999)
Hsieh, S.Y., Chen, G.H., Ho, C.W.: Hamiltonian-laceability of star graphs. Networks 36(4), 225–232 (2000)
Hsieh, S.Y., Chen, G.-H., Ho, C.-W.: Longest fault-free paths in star graphs with vertex faults. Theor. Comput. Sci. 262(1/2), 215–227 (2001)
Hsu, D.F.: Interconnection networks and algorithms. A special issue of Networks 23(4) (1993)
Leighton, F.T.: Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1992)
Lewinter, M., Widulski, W.: Hyper-Hamiltonian laceable and caterpillar-spannable product graphs. Comput. Math. Appl. 34(11), 99–104 (1997)
Rowley, R.A., Bose, B.: Fault-tolerant ring embedding in deBruijn networks. IEEE Trans. Comput. 42(12), 1480–1486 (1993)
Simmons, G.: Almost all n-dimensional rectangular lattices are Hamilton laceable. Congressus Numeratium 21, 103–108 (1978)
Sun, C.M., Lin, C.K., Huang, H.M., Hsu, L.H.: Mutually independent Hamiltonian paths and cycles in hypercubes. J. Interconnection Netw. 7(2), 235–255 (2006)
Tsai, C.-H.: Linear array and ring embedding in conditional faulty hypercubes. Theor. Comput. Sci. 314(3), 431–443 (2004)
Tsai, C.H., Tan, J.M., Linag, T., Hsu, L.H.: Fault-tolerant Hamiltonain laceability of hypercubes. Inf. Process. Lett. 83, 301–306 (2002)
Tseng, Y.-C., Chang, S.H., Sheu, J.P.: Fault-tolerant ring embedding in star graphs with both link and node failures. IEEE Trans. Parallel Distributed Syst. 8(12), 1185–1195 (1997)
Wang, D.: Embedding Hamiltonian cycles into folded hypercubes with faulty links. J. Parallel Distributed Comput. 61(4), 545–564 (2001)
Wang, N.C., Chu, C.P., Chen, T.S.: A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks. J. Parallel Distributed Comput. 62(12), 1747–1762 (2002)
Wang, N.C., Yen, C.P., Chu, C.P.: Multicast communication in wormhole-routed symmetric networks with Hamiltonian cycle model. J. Syst. Archit. 51(3), 165–183 (2005)
Xu, J.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic, Dordrecht (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hsieh, SY., Weng, YF. Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults. Theory Comput Syst 45, 407–425 (2009). https://doi.org/10.1007/s00224-008-9108-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-008-9108-z