Matching preclusion for balanced hypercubes
From MaRDI portal
Publication:1929236
Recommendations
Cites work
- Bipanconnectivity of balanced hypercubes
- Conditional matching preclusion for hypercube-like interconnection networks
- Conditional matching preclusion for the arrangement graphs
- Conditional matching preclusion sets
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Graph theory
- scientific article; zbMATH DE number 5016662 (Why is no real title available?)
- scientific article; zbMATH DE number 3641471 (Why is no real title available?)
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Matching preclusion for some interconnection networks
- Strong matching preclusion
Cited in
(60)- On gravitational repulsion
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
- Strong matching preclusion for \(k\)-composition networks
- Cycles embedding in balanced hypercubes with faulty edges and vertices
- Edge-disjoint Hamiltonian cycles of balanced hypercubes
- Matching preclusion number in product graphs
- Hamiltonian paths passing through prescribed edges in balanced hypercubes
- Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes
- Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes
- Matching preclusion for n-grid graphs
- Twin universes cosmology
- Structure and substructure connectivity of balanced hypercubes
- Matching preclusion for k-ary n-cubes with odd k 3
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
- The fractional matching preclusion number of complete n-balanced k-partite graphs
- Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
- The reliability analysis based on the generalized connectivity in balanced hypercubes
- A note on generalized matching preclusion in bipartite graphs
- Matching preclusion for direct product of regular graphs
- Fractional matching preclusion number of graphs and the perfect matching polytope
- Path embeddings with prescribed edge in the balanced hypercube network
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Matching preclusion for cube-connected cycles
- Matching preclusion for \(n\)-dimensional torus networks
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Conditional fractional matching preclusion of \(n\)-dimensional torus networks
- Hamiltonian cycles of balanced hypercube with more faulty edges
- Hamiltonian cycle embedding for fault tolerance in balanced hypercubes
- The genus of the balanced hypercube
- Strong matching preclusion for \(n\)-dimensional torus networks
- Matching preclusion for vertex-transitive networks
- Matching preclusion number in Cartesian product of graphs and its application to interconnection networks.
- Matching extendability of balanced hypercubes.
- scientific article; zbMATH DE number 5901714 (Why is no real title available?)
- On the edge-hyper-Hamiltonian laceability of balanced hypercubes
- Matching Extendability in Hypercubes
- Strong matching preclusion for augmented cubes
- Matching Preclusion for the Shuffle-Cubes
- Fractional Strong Matching Preclusion for DHcube
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- Antimatter gravity and the Universe
- Fault-free Hamiltonian cycles in balanced hypercubes with conditional edge faults
- Fractional strong matching preclusion for two variants of hypercubes
- Various cycles embedding in faulty balanced hypercubes
- Fault-tolerant Hamiltonian laceability of balanced hypercubes
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- On anti-Kekulé and s-restricted matching preclusion problems
- Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
- An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes
- Hamiltonian cycles of balanced hypercube with disjoint faulty edges
- The h-faulty-block connectivity of n-dimensional balanced hypercube
- The d-blocker number and d-transversal number of hexagonal systems
- Strong matching preclusion for folded hypercubes
- k-path-connectivity of balanced hypercubes for k = 3, 4
- On the d-blocker number of k-ary n-cubes
This page was built for publication: Matching preclusion for balanced hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929236)
