Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes

DOI10.1016/j.tcs.2016.02.029zbMath1338.68032OpenAlexW2288971222MaRDI QIDQ265087

Che-Nan Kuo, Iain A. Stewart

Publication date: 1 April 2016

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

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

zbMATH Keywords

fault toleranceinterconnection networksedge-bipancyclicityedge-pancyclicityfolded hypercubes

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

Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices ⋮ Cycles embedding in folded hypercubes under the conditional fault model ⋮ Vertex-pancyclicity of the \((n,k)\)-bubble-sort networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• Fault-free cycles in folded hypercubes with more faulty elements
• A further result on fault-free cycles in faulty folded hypercubes
• Path embedding in faulty hypercubes
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Embedding Hamiltonian cycles into folded hypercubes with faulty links
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant
• Task assignment in heterogeneous computing systems
• Cycles embedding on folded hypercubes with faulty nodes
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• The twisted N-cube with application to multiprocessing
• Some edge‐fault‐tolerant properties of the folded hypercube