Strong matching preclusion

DOI10.1016/j.tcs.2011.08.008zbMath1232.05186OpenAlexW2007968776MaRDI QIDQ653338

Jung-Heum Park, Insung Ihm

Publication date: 9 January 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.008

zbMATH Keywords

minimum strong matching preclusion setsstrong matching preclusion number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (31)

Strong matching preclusion for \(n\)-dimensional torus networks ⋮ Strong matching preclusion for non-bipartite torus 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 ⋮ Fractional matching preclusion of graphs ⋮ Strong matching preclusion for augmented cubes ⋮ Strong matching preclusion for torus networks ⋮ Matching preclusion for balanced hypercubes ⋮ Conditional matching preclusion number of graphs ⋮ Strong matching preclusion number of graphs ⋮ Strong matching preclusion for \(k\)-composition networks ⋮ Integer \(k\)-matching preclusion of some interconnection networks ⋮ Strong matching preclusion of \((n,k)\)-star graphs ⋮ A note on the strong matching preclusion problem for data center networks ⋮ Strong matching preclusion under the conditional fault model ⋮ Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract) ⋮ Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products ⋮ Matching preclusion number of graphs ⋮ Strong matching preclusion for \(k\)-ary \(n\)-cubes ⋮ Conditional matching preclusion for the arrangement graphs ⋮ A note on generalized matching preclusion in bipartite graphs ⋮ Fractional matching preclusion of the restricted HL-graphs ⋮ Fractional matching preclusion for radix triangular mesh ⋮ Minimum \(k\)-critical bipartite graphs ⋮ Fractional matching preclusion number of graphs ⋮ Fractional matching preclusion for arrangement graphs ⋮ Strong matching preclusion for two-dimensional torus networks ⋮ Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Perfect matchings in pruned grid graphs
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• Recursive circulants and their embeddings among hypercubes
• Perfect matchings after vertex deletions
• Conditional matching preclusion for the alternating group graphs and split-stars
• Graph Bipartization and via minimization
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Matching preclusion for some interconnection networks
• On Trivalent Graphs

This page was built for publication: Strong matching preclusion