Strong matching preclusion

DOI10.1016/j.tcs.2011.08.008zbMath1232.05186MaRDI 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 sets; strong matching preclusion number

Mathematics Subject Classification ID

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

Related Items

Strong matching preclusion for two-dimensional torus networks, Strong matching preclusion for \(n\)-dimensional torus 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, Conditional matching preclusion for the arrangement graphs, Strong matching preclusion of \((n,k)\)-star graphs, Strong matching preclusion number of graphs, Strong matching preclusion for \(k\)-composition networks, Matching preclusion number of graphs, Matching preclusion for balanced hypercubes, Strong matching preclusion under the conditional fault model, Strong matching preclusion for non-bipartite torus networks, Fractional matching preclusion of graphs, Strong matching preclusion for \(k\)-ary \(n\)-cubes

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