Various cycles embedding in faulty balanced hypercubes
DOI10.1016/J.INS.2014.11.008zbMATH Open1360.68642OpenAlexW2016848599MaRDI QIDQ527210FDOQ527210
Authors: Dongqin Cheng, Rong-Xia Hao
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
Recommendations
- Cycles embedding in balanced hypercubes with faulty edges and vertices
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- Fault-tolerant cycle embedding in the faulty hypercubes
- Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges.
- Cycles embedding in hypercubes with node failures
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
Cites Work
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Fault-tolerant path embedding in folded hypercubes with both node and edge faults
- Pancyclic graphs. I
- Title not available (Why is that?)
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- Edge-pancyclic block-intersection graphs
- The square of a block is vertex pancyclic
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Matching preclusion for balanced hypercubes
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Two node-disjoint paths in balanced hypercubes
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- Bipanconnectivity of balanced hypercubes
- Fault-tolerant cycles embedding in hypercubes with faulty edges
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Conditional edge-fault Hamiltonicity of augmented cubes
- Vertex-pancyclicity of augmented cubes with maximal faulty edges
- Title not available (Why is that?)
- Odd cycles embedding on folded hypercubes with conditional faulty edges
- Hamiltonian connectivity of the WK-recursive network with faulty nodes
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- The spanning laceability on the faulty bipartite hypercube-like networks
- Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
Cited In (17)
- Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
- An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes
- Cycles embedding in balanced hypercubes with faulty edges and vertices
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- The reliability analysis based on the generalized connectivity in balanced hypercubes
- On embedding cycles into faulty dual-cubes
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- The \(h\)-restricted connectivity of balanced hypercubes
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes
- Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
- Hamiltonian paths and cycles pass through prescribed edges in the 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
- Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
This page was built for publication: Various cycles embedding in faulty balanced hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q527210)