Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
From MaRDI portal
(Redirected from Publication:444435)
Recommendations
- Matching preclusion and conditional matching preclusion problems for twisted cubes
- Conditional matching preclusion sets
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph \(P(n,3)\)
Cites work
- scientific article; zbMATH DE number 5016662 (Why is no real title available?)
- Conditional matching preclusion for hypercube-like interconnection networks
- Conditional matching preclusion for the alternating group graphs and Split-stars
- Conditional matching preclusion sets
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- Matching preclusion and conditional matching preclusion problems for twisted cubes
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Matching preclusion for some interconnection networks
- Strong matching preclusion
Cited in
(33)- Strong matching preclusion for torus networks
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- On anti-Kekulé and \(s\)-restricted matching preclusion problems
- Matching preclusion for balanced hypercubes
- Strong matching preclusion for \(n\)-dimensional torus networks
- Conditional \(k\)-matching preclusion for \(n\)-dimensional torus networks
- Note on matching preclusion number of random graphs
- The (conditional) matching preclusion for burnt pancake graphs
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Strong matching preclusion for two-dimensional torus networks
- Fractional matching preclusion of product networks
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Matching preclusion number in Cartesian product of graphs and its application to interconnection networks.
- Fractional matching preclusion number of graphs and the perfect matching polytope
- Conditional fractional matching preclusion of \(n\)-dimensional torus networks
- Matching preclusion for \(n\)-dimensional torus networks
- Matching preclusion for \(n\)-grid graphs
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- The super spanning connectivity and super spanning laceability of tori with faulty elements
- Matching preclusion for direct product of regular graphs
- Matching preclusion number in product graphs
- Matching preclusion and conditional matching preclusion problems for twisted cubes
- Fractional matching preclusion numbers of Cartesian product graphs
- Matching preclusion for cube-connected cycles
- Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- Matching preclusion for vertex-transitive networks
- Integer \(k\)-matching preclusion of some interconnection networks
- The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs
- Strong matching preclusion for non-bipartite torus networks
This page was built for publication: Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444435)
