Fault-tolerant cycles embedding in folded hypercubes
From MaRDI portal
Publication:2825274
DOI10.1007/s11859-016-1158-5zbMath1363.05053OpenAlexW2507636882MaRDI QIDQ2825274
Publication date: 6 October 2016
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11859-016-1158-5
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- On ring embedding in hypercubes with faulty nodes and links
- Paths and cycles embedding on faulty enhanced hypercube networks
- Fault-tolerant cycle embedding in the hypercube
- The super laceability of the hypercubes
- 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
- Edge-fault-tolerant bipanconnectivity of hypercubes
- Hamiltonicity of the hierarchical cubic network
- Linear array and ring embeddings in conditional faulty hypercubes
- Fault-tolerant path embedding in folded hypercubes with both node and edge faults
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in Folded Cubes
- Complete binary trees in folded and enhanced cubes
- Hamiltonian-laceability of star graphs