A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges

DOI10.1016/j.ipl.2008.02.016zbMath1186.68035OpenAlexW2039702758MaRDI QIDQ963441

Wen-Qing Wang, Xie-Bin Chen

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.02.016

zbMATH Keywords

hypercubecycleHamiltonian cycleinterconnection networksedge fault tolerance

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (25)

Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions ⋮ Perfect matchings extend to two or more Hamiltonian cycles in hypercubes ⋮ Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Edge-fault-tolerant diameter and bipanconnectivity of hypercubes ⋮ Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges ⋮ Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes ⋮ Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges ⋮ Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube ⋮ Some results on topological properties of folded hypercubes ⋮ On path bipancyclicity of hypercubes ⋮ Hamiltonian paths and cycles passing through a prescribed path in hypercubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Many-to-many disjoint paths in faulty hypercubes ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges ⋮ Cycles passing through a prescribed path in a hypercube with faulty edges ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links

Cites Work

• Unnamed Item
• Unnamed Item
• On ring embedding in hypercubes with faulty nodes and links
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• A survey of the theory of hypercube graphs
• Linear array and ring embeddings in conditional faulty hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Edge-bipancyclicity of conditional faulty hypercubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Hamiltonian Cycles with Prescribed Edges in Hypercubes

This page was built for publication: A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges