Vertex-fault-tolerant cycles embedding on enhanced hypercube networks
From MaRDI portal
Publication:5890607
DOI10.1007/S10255-016-0547-ZzbMath1405.05179OpenAlexW2325186483MaRDI QIDQ5890607
Publication date: 21 April 2016
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-016-0547-z
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Paths and cycles (05C38)
Cites Work
- Unnamed Item
- Unnamed Item
- Fault-tolerant cycle embedding in the hypercube
- Cycles embedding in hypercubes with node failures
- Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes
- Path embedding in faulty hypercubes
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Edge-fault-tolerant edge-bipancyclicity of hypercubes
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
- Complete binary trees in folded and enhanced cubes
- Some edge‐fault‐tolerant properties of the folded hypercube
- Vertex-fault-tolerant cycles embedding on enhanced hypercube networks
This page was built for publication: Vertex-fault-tolerant cycles embedding on enhanced hypercube networks