Abstract
Let R and F be two disjoint edge sets in an n-dimensional hypercube Q n . We give two constructing methods to build a Hamiltonian cycle or path that includes all the edges of R but excludes all of F. Besides, considering every vertex of Q n incident to at most n−2 edges of F, we show that a Hamiltonian cycle exists if (A) |R|+2|F|≤2n−3 when |R|≥2, or (B) |R|+2|F|≤4n−9 when |R|≤1. Both bounds are tight. The analogous property for Hamiltonian paths is also given.
Similar content being viewed by others
References
Latifi S, Zheng S, Bagherzadeh N (1992) Optimal ring embedding in hypercubes with faulty links. In: Fault-tolerant computing symposium, pp 178–184
Häggkvist R (1979) On F-Hamiltonian graphs. In: Bondy, Murty (eds) Graph theory and related topics. Academic, New York, pp 219–231
Hsu LH, Liu SC, Yeh YN (2001) Edge-required and edge-fault-tolerant Hamiltonicity of hypercubes. In: Second pacific rim conference on mathematics, Taipei
Kronk HV (1969) Variations on a theorem of Posa. In: Chartrand G, Kapoor SF (eds) The many facets of graph theory. Springer, Berlin, pp 193–197
Sengupta A (1998) On ring embedding in hypercubes with faulty nodes and links. Inf Process Lett 68(4):207–214
Simmons G (1978) Almost all n-dimensional rectangular lattices are Hamilton-laceable. Congr Numer 21:649–661
Tseng YC (1996) Embedding a ring in a hypercube with both faulty links and faulty nodes. Inf Process Lett 59:217–222
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Professor Frank K. Hwang on the occasion of his 65th birthday.
Lih-Hsing Hsu’s research project is partially supported by NSC 95-2221-E-233-002.
Shu-Chung Liu’s research project is partially supported by NSC 90-2115-M-163-003 and 95-2115-M-163-002.
Yeong-Nan Yeh’s research project is partially supported by NSC 95-2115-M-001-009.
Rights and permissions
About this article
Cite this article
Hsu, LH., Liu, SC. & Yeh, YN. Hamiltonicity of hypercubes with a constraint of required and faulty edges. J Comb Optim 14, 197–204 (2007). https://doi.org/10.1007/s10878-007-9059-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9059-3