Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes
DOI10.1016/J.IPL.2021.106160OpenAlexW3175579885MaRDI QIDQ2234786FDOQ2234786
Authors: Eminjan Sabir, Jixiang Meng
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Title not available (Why is that?)
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Structure connectivity and substructure connectivity of hypercubes
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Hamiltonicity of hypercubes with faulty vertices
Cited In (6)
- Hamiltonicity of hypercubes with faulty vertices
- Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
- Proof of Locke's conjecture. I
- Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern
- Hamiltonian laceability of hypercubes without isometric subgraphs
- Subcube fault-tolerance in hypercubes
This page was built for publication: Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234786)