Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
DOI10.1142/S0129054121500039zbMATH Open1458.68023OpenAlexW3118711890MaRDI QIDQ5859673FDOQ5859673
Authors: Chunfang Li, Shangwei Lin, Shengjia Li 
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054121500039
Recommendations
- Hamiltonian cycles in hypercubes with more faulty edges
- Hamiltonian cycles in hypercubes with faulty edges
- Fault-tolerant cycles embedding in hypercubes with faulty edges
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Fault-tolerant cycle embedding in the faulty hypercubes
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
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Hamiltonian cycle embedding for fault tolerance in balanced hypercubes
- Conditional edge-fault pancyclicity of augmented cubes
- Fault-tolerant cycle embedding in the hypercube
- Linear array and ring embeddings in conditional faulty hypercubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- The \(g\)-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model
- Fault-tolerant Hamiltonian laceability of hypercubes.
- The \(g\)-good neighbor conditional diagnosability of twisted hypercubes under the PMC and MM* model
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- Longest fault-free paths in hypercubes with vertex faults
- Sufficient conditions for a graph to be super restricted edge-connected
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Hamiltonicity of the torus network under the conditional fault model
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
- Cycle embedding in star graphs with conditional edge faults
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
- Hamiltonian cycles in hypercubes with faulty edges
- Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- Various cycles embedding in faulty balanced hypercubes
- The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks
- Hamiltonian laceability in hypercubes with faulty edges
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- Conditional edge-fault-tolerant Hamiltonicity of the data center network
Cited In (8)
- Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes
- Hamiltonian cycles in hypercubes with more faulty edges
- On the mutually independent Hamiltonian cycles in faulty hypercubes
- A computer-aided examination of some classes of hypercube-like super fault-tolerant Hamiltonian networks
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
- \(r\)-component diagnosability of hypercubes under the PMC model
- Embedding a fault-free Hamiltonian cycle in a class of faulty generalized honeycomb tori
This page was built for publication: Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859673)
