A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges

Tz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang (), Jimmy J. M. Tan and Lih-Hsing Hsu
Additional contact information
Tz-Liang Kueng: National Chiao Tung University
Cheng-Kuan Lin: National Chiao Tung University
Tyne Liang: National Chiao Tung University
Jimmy J. M. Tan: National Chiao Tung University
Lih-Hsing Hsu: Providence University

Journal of Combinatorial Optimization, 2009, vol. 17, issue 3, No 4, 312-322

Abstract: Abstract In the paper “Fault-free Mutually Independent Hamiltonian Cycles in Hypercubes with Faulty Edges” (J. Comb. Optim. 13:153–162, 2007), the authors claimed that an n-dimensional hypercube can be embedded with (n−1−f)-mutually independent Hamiltonian cycles when f≤n−2 faulty edges may occur accidentally. However, there are two mistakes in their proof. In this paper, we give examples to explain why the proof is deficient. Then we present a correct proof.

Keywords: Interconnection network; Hypercube; Fault tolerance; Hamiltonian cycle (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9113-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:17:y:2009:i:3:d:10.1007_s10878-007-9113-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9113-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().