Path Embedding on Folded Hypercubes

DOI10.1007/978-3-540-72504-6_68MaRDI QIDQ5425487zbMATH OpenOpenAlexFDO

Authors Sun-Yuan Hsieh

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72504-6_68

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Some edge‐fault‐tolerant properties of the folded hypercube
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• Edge-fault-tolerant properties of hypercubes and folded hypercubes
• Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant
• scientific article; zbMATH DE number 6263048

Cited in

(11)

• Embedding Hamiltonian cycles into folded hypercubes with faulty links
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• An efficient construction of one-to-many node-disjoint paths in folded hypercubes
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• Complete path embeddings in crossed cubes
• Embedding of the folded hypercubes into tori
• Algebraic properties and panconnectivity of folded hypercubes.
• Embedding Four-directional Paths on Convex Point Sets
• Some edge‐fault‐tolerant properties of the folded hypercube
• The spanning connectivity of folded hypercubes

This page was built for publication: Path Embedding on Folded Hypercubes

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