Strong matching preclusion under the conditional fault model

DOI10.1016/j.dam.2012.10.002zbMath1262.05130MaRDI QIDQ1949116

Jung-Heum Park, Insung Ihm

Publication date: 25 April 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.002

zbMATH Keywords

perfect matchings; strong matching preclusion; almost perfect matchings; conditional vertex/edge faults; restricted hypercube-like graph

Mathematics Subject Classification ID

05C65: Hypergraphs

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

Related Items

Strong matching preclusion for two-dimensional torus networks, Conditional matching preclusion number of graphs, Strong matching preclusion for \(n\)-dimensional torus networks, Strong matching preclusion number of graphs, Matching preclusion number of graphs, Fractional matching preclusion number of graphs, A note on the strong matching preclusion problem for data center networks, Fractional matching preclusion of the restricted HL-graphs

Cites Work

• Unnamed Item
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion
• Perfect matchings in pruned grid graphs
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• Perfect matchings after vertex deletions
• Conditional matching preclusion for the alternating group graphs and split-stars
• Matching preclusion for the (n, k)-bubble-sort graphs
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Matching preclusion for some interconnection networks