Matching preclusion for some interconnection networks

DOI10.1002/NET.20187MaRDI QIDQ5310271zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

Cayley graphsinterconnection networksperfect matching\((n,k)\)-star graphs

Mathematics Subject Classification ID

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)

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

(59)

• Fractional matching preclusion for radix triangular mesh
• On anti-Kekulé and \(s\)-restricted matching preclusion problems
• Conditional \(k\)-matching preclusion for \(n\)-dimensional torus networks
• How to Secure Matchings Against Edge Failures
• Fractional matching preclusion for data center networks
• Fractional matching preclusion for data center networks
• Matching preclusion of boxdot products
• How to Secure Matchings against Edge Failures
• Integer \(k\)-matching preclusion of graphs
• Strong matching preclusion for torus networks
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion for the (n, k)-bubble-sort graphs
• Matching preclusion for balanced hypercubes
• Strong matching preclusion for \(k\)-composition networks
• A short note of strong matching preclusion for a class of arrangement graphs
• Conditional matching preclusion for the alternating group graphs and Split-stars
• Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
• Strong matching preclusion number of graphs
• Strong matching preclusion for \(n\)-dimensional torus networks
• Matching preclusion and conditional matching preclusion for crossed cubes
• Conditional matching preclusion number of graphs
• Matching preclusion number of graphs
• Note on matching preclusion number of random 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
• The (conditional) matching preclusion for burnt pancake graphs
• Strong matching preclusion under the conditional fault model
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• Strong matching preclusion for two-dimensional torus networks
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Fractional matching preclusion of product networks
• Subnetwork preclusion for bubble-sort networks
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Conditional matching preclusion for the arrangement graphs
• A note on generalized matching preclusion in bipartite graphs
• Matching preclusion number in Cartesian product of graphs and its application to interconnection networks.
• Fractional matching preclusion number of graphs
• CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
• Conditional fractional matching preclusion of \(n\)-dimensional torus networks
• Strong matching preclusion of \((n,k)\)-star graphs
• Matching preclusion for \(n\)-dimensional torus networks
• Fractional matching preclusion for \((n,k)\)-star graphs
• Efficient algorithms for checking the equivalence of multistage interconnection networks
• Fractional matching preclusion for arrangement graphs
• Matching preclusion for \(n\)-grid graphs
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• Conditional fault tolerance in a class of Cayley graphs
• Restricted connectivity for some interconnection networks
• Strong matching preclusion
• Matching preclusion number in product graphs
• Conditional matching preclusion sets
• Matching preclusion for cube-connected cycles
• Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)
• Matching preclusion for vertex-transitive networks
• Strong matching preclusion for augmented cubes
• Fractional Strong Matching Preclusion for DHcube
• Conditional matching preclusion for hypercube-like interconnection networks
• Strong matching preclusion for non-bipartite torus networks

Describes a project that uses

Uses Software

• CPLEX

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)