Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults

DOI10.1142/S1793830916500014zbMath1354.68026MaRDI QIDQ2798312

Che-Nan Kuo

Publication date: 12 April 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

cycleembeddinghypercubesinterconnection networksfolded hypercubesfault-tolerantfault-free

Mathematics Subject Classification ID

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

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
• Path embedding in faulty hypercubes
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• 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