Fault-tolerant hamiltonian laceability of hypercubes

Information Processing Letters

Volumn 83, Issue 6, 2002, Pages 301-306

  Tsai, Chang Hsiung ^a   Tan, Jimmy J M ^a   Liang, Tyne ^a   Hsu, Lih Hsing ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Fault tolerance; Hamiltonian laceable; Hypercube

Indexed keywords

GRAPH THEORY; HAMILTONIANS; SET THEORY; THEOREM PROVING;

BIPARTITE GRAPHS; HAMILTONIAN PATHS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0037200865     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00214-4     Document Type: Article

References (8)

1. Hypercubes and other recursively defined hamilton laceable graphs
2. Hamiltonian-laceability of star graphs
3. Fault-free hamiltonian cycles in faulty arrangement graphs
4. Optimal ring embedding in hypercubes with faulty links
5. Hyper-Hamilton laceable and caterpillar-spannable product graphs
6. Almost all n-dimensional rectangular lattices are Hamilton laceable