Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant

DOI10.1016/j.tcs.2015.04.012zbMath1319.68030OpenAlexW2065601350MaRDI QIDQ2346376

Che-Nan Kuo

Publication date: 1 June 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.012

zbMATH Keywords

cycleembeddinghypercubesinterconnection networksfolded hypercubesfault-tolerantfault-free

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (5)

Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges ⋮ Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes ⋮ Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes ⋮ Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices ⋮ Cycles embedding in folded hypercubes with conditionally faulty vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• A note on cycle embedding in folded hypercubes with faulty elements
• Fault-free cycles in folded hypercubes with more faulty elements
• A further result on fault-free cycles in faulty folded 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
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Embedding Hamiltonian cycles into folded hypercubes with faulty links
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• Cycles embedding on folded hypercubes with faulty nodes
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• Cycles in folded hypercubes
• Hamiltonian-laceability of star graphs
• The twisted N-cube with application to multiprocessing
• Some edge‐fault‐tolerant properties of the folded hypercube

This page was built for publication: Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant