Hamiltonicity of hypercubes with faulty vertices
From MaRDI portal
Publication:5964820
DOI10.1016/j.ipl.2015.09.018zbMath1352.68194OpenAlexW2281684213MaRDI QIDQ5964820
Publication date: 1 March 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.018
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)
Related Items
Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes
Cites Work
- Unnamed Item
- Paired many-to-many disjoint path covers in faulty hypercubes
- The 2-path-bipanconnectivity of hypercubes
- Many-to-many disjoint paths in faulty hypercubes
- Cycles embedding in hypercubes with node failures
- Edge-bipancyclicity of a hypercube with faulty vertices and edges
- Path partitions of hypercubes
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Path embedding in faulty hypercubes
- Edge-fault-tolerant bipanconnectivity of hypercubes
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- Survey on path and cycle embedding in some networks
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
- Path coverings with prescribed ends in faulty hypercubes
- Spanning multi-paths in hypercubes
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Paired many-to-many disjoint path covers of the hypercubes
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
This page was built for publication: Hamiltonicity of hypercubes with faulty vertices
