Cycles passing through prescribed edges in a hypercube with some faulty edges

DOI10.1016/j.ipl.2007.06.014zbMath1184.68113OpenAlexW2024878111MaRDI QIDQ2380025

Xie-Bin Chen

Publication date: 24 March 2010

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

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

zbMATH Keywords

hypercubecycleembeddingfault toleranceinterconnection networksedge fault tolerance

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (26)

Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of 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 ⋮ 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 ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ Bipanconnectivity of faulty hypercubes with minimum degree ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Hamiltonian paths passing through prescribed edges in balanced hypercubes ⋮ 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 ⋮ A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with 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 ⋮ Many-to-many disjoint paths in faulty hypercubes ⋮ Hamiltonicity of hypercubes with faulty vertices ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges ⋮ Fault-free cycles passing through prescribed paths in hypercubes with faulty edges ⋮ Cycles passing through a prescribed path in a hypercube with faulty edges ⋮ Survey on path and cycle embedding in some networks ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links

Cites Work

• Unnamed Item
• Unnamed Item
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Fault-tolerant cycle-embedding of crossed cubes
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• A survey of the theory of hypercube graphs
• Edge-pancyclic block-intersection graphs
• Linear array and ring embeddings in conditional faulty hypercubes
• Cycles in folded hypercubes
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Hamiltonian Cycles with Prescribed Edges in Hypercubes

This page was built for publication: Cycles passing through prescribed edges in a hypercube with some faulty edges