Various cycles embedding in faulty balanced hypercubes
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3902696 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Bipanconnectivity of balanced hypercubes
- Conditional edge-fault Hamiltonicity of augmented cubes
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- Edge-pancyclic block-intersection graphs
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
- Fault-tolerant cycles embedding in hypercubes with faulty edges
- Fault-tolerant path embedding in folded hypercubes with both node and edge faults
- Hamiltonian connectivity of the WK-recursive network with faulty nodes
- Matching preclusion for balanced hypercubes
- Odd cycles embedding on folded hypercubes with conditional faulty edges
- Pancyclic graphs. I
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- The spanning laceability on the faulty bipartite hypercube-like networks
- The square of a block is vertex pancyclic
- Two node-disjoint paths in balanced hypercubes
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- Vertex-pancyclicity of augmented cubes with maximal faulty edges
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
- The pessimistic diagnosability of three kinds of graphs
- Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
- Fault-free Hamiltonian cycles in balanced hypercubes with conditional edge faults
- The 3-extra conditional diagnosability of balanced hypercubes under \(\mathrm{MM}^\ast\) model
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
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)