Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes
From MaRDI portal
Publication:2234786
DOI10.1016/j.ipl.2021.106160OpenAlexW3175579885MaRDI QIDQ2234786
Publication date: 19 October 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106160
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- Unnamed Item
- Structure connectivity and substructure connectivity of hypercubes
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Hamiltonicity of hypercubes with faulty vertices
This page was built for publication: Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes