Matching preclusion for cube-connected cycles
From MaRDI portal
Recommendations
- Matching preclusion and conditional matching preclusion for crossed cubes
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Matching preclusion and conditional matching preclusion problems for twisted cubes
- Cycles in cube-connected cycles graphs
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Matching preclusion for balanced hypercubes
- Matching preclusion and conditional matching preclusion for dual-cubes
- Cycles in the cube-connected cycles graph
- Strong matching preclusion for augmented cubes
Cites work
- scientific article; zbMATH DE number 5016662 (Why is no real title available?)
- scientific article; zbMATH DE number 1545446 (Why is no real title available?)
- scientific article; zbMATH DE number 874369 (Why is no real title available?)
- scientific article; zbMATH DE number 5032352 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- Conditional matching preclusion for hypercube-like interconnection networks
- Conditional matching preclusion for the alternating group graphs and Split-stars
- Conditional matching preclusion for the arrangement graphs
- Conditional matching preclusion sets
- Cycles in the cube-connected cycles graph
- Embedding cube-connected cycles graphs into faulty hypercubes
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion and conditional matching preclusion problems for twisted cubes
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Matching preclusion for balanced hypercubes
- Matching preclusion for some interconnection networks
- Matching preclusion for the (n, k)-bubble-sort graphs
- Matching theory
- On Representatives of Subsets
- On \(k\)-factor-critical graphs
- On crossing numbers of hypercubes and cube connected cycles
- On the pagenumber of the cube-connected cycles
- Optimally super-edge-connected transitive graphs
- Super cyclically edge connected transitive graphs
- The (conditional) matching preclusion for burnt pancake graphs
- The diameter of the cube-connected cycles
Cited in
(11)- Fractional matching preclusion number of graphs and the perfect matching polytope
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- Strong matching preclusion for \(n\)-dimensional torus networks
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- On anti-Kekulé and \(s\)-restricted matching preclusion problems
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- Matching preclusion for direct product of regular graphs
- The fractional matching preclusion number of complete n-balanced k-partite graphs
- scientific article; zbMATH DE number 6000733 (Why is no real title available?)
- Matching preclusion for \(n\)-dimensional torus networks
- Fractional matching preclusion numbers of Cartesian product graphs
This page was built for publication: Matching preclusion for cube-connected cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352789)
