Matching preclusion for some interconnection networks
From MaRDI portal
Publication:5310271
Recommendations
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Conditional matching preclusion for hypercube-like interconnection networks
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Matching preclusion for vertex-transitive networks
- Matching preclusion number in Cartesian product of graphs and its application to interconnection networks.
- Matching preclusion for \(n\)-dimensional torus networks
- A note on the strong matching preclusion problem for data center networks
- Fractional matching preclusion for data center networks
- Fractional matching preclusion for data center networks
- Maximum matching in multi-interface networks
Cited in
(64)- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Strong matching preclusion number of graphs
- Strong matching preclusion for \(k\)-composition networks
- Matching preclusion number of graphs
- Matching preclusion number in product graphs
- Matching preclusion for n-grid graphs
- Efficient algorithms for checking the equivalence of multistage interconnection networks
- Matching preclusion for balanced hypercubes
- Strong matching preclusion under the conditional fault model
- Matching preclusion for k-ary n-cubes with odd k 3
- Fractional matching preclusion number of graphs
- Fractional matching preclusion of product networks
- A note on generalized matching preclusion in bipartite graphs
- Fractional matching preclusion for arrangement graphs
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Matching preclusion for cube-connected cycles
- Subnetwork preclusion for bubble-sort networks
- Matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for non-bipartite torus networks
- The (conditional) matching preclusion for burnt pancake graphs
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Conditional fractional matching preclusion of \(n\)-dimensional torus networks
- Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
- Conditional fault tolerance in a class of Cayley graphs
- Strong matching preclusion for \(n\)-dimensional torus networks
- Matching preclusion for vertex-transitive networks
- 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 number in Cartesian product of graphs and its application to interconnection networks.
- Conditional matching preclusion for the alternating group graphs and Split-stars
- Matching preclusion for the (n, k)-bubble-sort graphs
- Matching preclusion and conditional matching preclusion for crossed cubes
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- Strong matching preclusion for augmented cubes
- Strong matching preclusion for torus networks
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Restricted connectivity for some interconnection networks
- A short note of strong matching preclusion for a class of arrangement graphs
- Fractional matching preclusion for data center networks
- Fractional Strong Matching Preclusion for DHcube
- Fractional matching preclusion for data center networks
- Fractional matching preclusion for (n,k)-star graphs
- How to Secure Matchings Against Edge Failures
- How to Secure Matchings against Edge Failures
- Fractional matching preclusion for radix triangular mesh
- Matching preclusion of boxdot products
- Strong matching preclusion for two-dimensional torus networks
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
- On anti-Kekulé and s-restricted matching preclusion problems
- Conditional matching preclusion number of graphs
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Conditional matching preclusion for the arrangement graphs
- Strong matching preclusion
- Conditional \(k\)-matching preclusion for \(n\)-dimensional torus networks
- Integer k-matching preclusion of graphs
- The d-blocker number and d-transversal number of hexagonal systems
- Higher order matching preclusion for regular interconnection networks
- Sufficient conditions for the existence of path-factors with given properties
- Conditional fractional matching preclusion number of graphs
- On the d-blocker number of k-ary n-cubes
- Note on matching preclusion number of random graphs
- Strong matching preclusion of (n,k)-star graphs
This page was built for publication: Matching preclusion for some interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310271)
