Matching preclusion for some interconnection networks
From MaRDI portal
Publication:5310271
DOI10.1002/NET.20187zbMATH Open1123.05073OpenAlexW4245743540WikidataQ56638364 ScholiaQ56638364MaRDI QIDQ5310271FDOQ5310271
Authors: Eddie Cheng, L. Lipták 
Publication date: 21 September 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20187
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
Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (59)
- Fractional Matching Preclusion for Data Center Networks
- Fractional Matching Preclusion for Data Center Networks
- How to Secure Matchings Against Edge Failures
- How to Secure Matchings against Edge Failures
- On anti-Kekulé and \(s\)-restricted matching preclusion problems
- Matching preclusion of boxdot products
- Fractional matching preclusion for radix triangular mesh
- Integer \(k\)-matching preclusion of graphs
- Conditional \(k\)-matching preclusion for \(n\)-dimensional torus networks
- Conditional matching preclusion for the arrangement graphs
- Fractional matching preclusion number of graphs
- Subnetwork preclusion for bubble-sort networks
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
- Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)
- Strong matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for two-dimensional torus networks
- Matching preclusion for vertex-transitive networks
- Strong matching preclusion for augmented cubes
- Strong matching preclusion for torus networks
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Efficient algorithms for checking the equivalence of multistage interconnection networks
- Strong matching preclusion
- Strong matching preclusion of \((n,k)\)-star graphs
- Fractional matching preclusion for arrangement graphs
- Conditional fault tolerance in a class of Cayley graphs
- A note on generalized matching preclusion in bipartite graphs
- A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs
- Conditional fractional matching preclusion of \(n\)-dimensional torus networks
- Matching preclusion for balanced hypercubes
- Strong matching preclusion for \(k\)-composition networks
- Matching preclusion number of graphs
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
- Matching preclusion for \(n\)-grid graphs
- Fractional Matching Preclusion for (n,k)-Star Graphs
- Strong matching preclusion under the conditional fault model
- Fractional matching preclusion of product networks
- Conditional matching preclusion for the alternating group graphs and Split-stars
- Matching preclusion and conditional matching preclusion for crossed cubes
- Matching preclusion number in Cartesian product of graphs and its application to interconnection networks.
- Matching preclusion for cube-connected cycles
- Conditional matching preclusion number of graphs
- Note on matching preclusion number of random graphs
- Matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- The (conditional) matching preclusion for burnt pancake graphs
- Restricted connectivity for some interconnection networks
- Fractional Strong Matching Preclusion for DHcube
- Strong matching preclusion number of graphs
- 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 for the (n, k)-bubble-sort graphs
- Matching preclusion number in product graphs
- Strong matching preclusion for non-bipartite torus networks
Uses Software
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)
