Hamiltonian cycles in hypercubes with faulty edges
From MaRDI portal
Publication:497955
DOI10.1016/j.ins.2013.09.012zbMath1320.68130OpenAlexW1970820267MaRDI QIDQ497955
Publication date: 25 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.09.012
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)
Related Items (13)
Perfect matchings extend to two or more Hamiltonian cycles in hypercubes ⋮ The minimum spectral radius of an edge-removed network: a hypercube perspective ⋮ Hamiltonian cycles of balanced hypercube with more faulty edges ⋮ Hamiltonian laceability in hypercubes with faulty edges ⋮ Hamiltonian cycles and paths in hypercubes with disjoint faulty edges ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Vertex-fault-tolerant cycles embedding in balanced hypercubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults ⋮ Component Edge Connectivity of Hypercubes ⋮ Hamiltonian cycles in hypercubes with more faulty edges ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model ⋮ Hamiltonicity of the Torus Network Under the Conditional Fault Model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Long paths and cycles in hypercubes with faulty vertices
- Long paths in hypercubes with conditional node-faults
- Linear array and ring embeddings in conditional faulty hypercubes
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Long cycles in hypercubes with optimal number of faulty vertices
- 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
- Dynamic fault-tree models for fault-tolerant computer systems
- Edge fault tolerance in graphs
- The twisted N-cube with application to multiprocessing
This page was built for publication: Hamiltonian cycles in hypercubes with faulty edges