Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
From MaRDI portal
Publication:2656951
DOI10.1016/j.dam.2021.01.026zbMath1464.05331OpenAlexW3126685952MaRDI QIDQ2656951
Publication date: 17 March 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.01.026
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes
- Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes
- Cycles embedding in folded hypercubes with conditionally faulty vertices
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes
- A further result on fault-free cycles in faulty folded hypercubes
- Path embedding in faulty hypercubes
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Linear array and ring embeddings in conditional faulty hypercubes
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant
- Cycles embedding on folded hypercubes with faulty nodes
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- The twisted N-cube with application to multiprocessing
This page was built for publication: Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices