Cycles embedding in folded hypercubes with conditionally faulty vertices
From MaRDI portal
Publication:507576
DOI10.1016/j.dam.2016.12.008zbMath1355.05142OpenAlexW2569503713MaRDI QIDQ507576
Publication date: 6 February 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.12.008
Related Items (9)
An asymptotic relation between the wirelength of an embedding and the Wiener index ⋮ Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices ⋮ An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength ⋮ On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes ⋮ Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes ⋮ Embedding Wheel - like Networks ⋮ Cycles embedding in balanced hypercubes with faulty edges and vertices ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes
- Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults
- 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
- Long paths in hypercubes with conditional node-faults
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Fault-tolerant path embedding in folded hypercubes with both node and edge faults
- Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant
- Cycles embedding on folded hypercubes with faulty nodes
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Conditional connectivity
- The twisted N-cube with application to multiprocessing
- Some edge‐fault‐tolerant properties of the folded hypercube
This page was built for publication: Cycles embedding in folded hypercubes with conditionally faulty vertices