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

DOI10.1016/J.TCS.2015.04.012MaRDI QIDQ2346376zbMATH OpenOpenAlexFDO

Authors 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

cycleembeddingfault-freefault-tolerantfolded hypercubeshypercubesinterconnection networks

Mathematics Subject Classification ID

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

Recommendations

• Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults
• Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
• Odd cycles embedding on folded hypercubes with conditional faulty edges
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• Cycles embedding on folded hypercubes with faulty nodes

Cites work

• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• A further result on fault-free cycles in faulty folded hypercubes
• A note on cycle embedding in folded hypercubes with faulty elements
• Cycles embedding on folded hypercubes with faulty nodes
• Cycles in folded hypercubes
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Edge-fault-tolerant properties of hypercubes and folded hypercubes
• Embedding Hamiltonian cycles into folded hypercubes with faulty links
• Fault-free cycles in folded hypercubes with more faulty elements
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• Hamiltonian-laceability of star graphs
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 870411 (Why is no real title available?)
• scientific article; zbMATH DE number 6139910 (Why is no real title available?)
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Linear array and ring embeddings in conditional faulty hypercubes
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Some edge‐fault‐tolerant properties of the folded hypercube
• The twisted N-cube with application to multiprocessing

Cited in

(14)

• Cycles in folded hypercubes with two adjacent faulty vertices
• Cycles embedding on folded hypercubes with faulty nodes
• Cycles in folded hypercubes
• Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges
• Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes
• Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
• Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes
• Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults
• Optimal edge fault-tolerant bijective embedding of a complete graph over a cycle
• Embedding even cycles on folded hypercubes with conditional faulty edges
• Cycles embedding in folded hypercubes with conditionally faulty vertices
• Odd cycles embedding on folded hypercubes with conditional faulty edges
• Path Embedding on Folded Hypercubes
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346376)