Various cycles embedding in faulty balanced hypercubes
From MaRDI portal
Publication:527210
DOI10.1016/J.INS.2014.11.008zbMath1360.68642OpenAlexW2016848599MaRDI QIDQ527210
Publication date: 16 May 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.11.008
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (14)
Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes ⋮ Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ Cycles embedding in balanced hypercubes with faulty edges and vertices ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes ⋮ Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes ⋮ The \(h\)-restricted connectivity of balanced hypercubes ⋮ The pessimistic diagnosability of three kinds of graphs ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults ⋮ The 3-extra conditional diagnosability of balanced hypercubes under \(\mathrm{MM}^\ast\) model ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model
Cites Work
- Unnamed Item
- Unnamed Item
- Two node-disjoint paths in balanced hypercubes
- Fault-tolerant cycles embedding in hypercubes with faulty edges
- Odd cycles embedding on folded hypercubes with conditional faulty edges
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- Bipanconnectivity of balanced hypercubes
- Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
- Vertex-pancyclicity of augmented cubes with maximal faulty edges
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Conditional edge-fault Hamiltonicity of augmented cubes
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Hamiltonian connectivity of the WK-recursive network with faulty nodes
- Edge-pancyclic block-intersection graphs
- The square of a block is vertex pancyclic
- Matching preclusion for balanced hypercubes
- Fault-tolerant path embedding in folded hypercubes with both node and edge faults
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- The spanning laceability on the faulty bipartite hypercube-like networks
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Pancyclic graphs. I
This page was built for publication: Various cycles embedding in faulty balanced hypercubes