Strong matching preclusion under the conditional fault model

DOI10.1016/J.DAM.2012.10.002MaRDI QIDQ1949116zbMATH OpenOpenAlexFDO

Authors 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 matchingsstrong matching preclusionalmost perfect matchingsconditional vertex/edge faultsrestricted hypercube-like graph

Mathematics Subject Classification ID

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

Recommendations

• The conditional strong matching preclusion of augmented cubes
• Strong matching preclusion
• Conditional matching preclusion for hypercube-like interconnection networks
• Conditional strong matching preclusion of the alternating group graph
• Conditional matching preclusion sets

Cites work

• scientific article; zbMATH DE number 5016662 (Why is no real title available?)
• Conditional matching preclusion for hypercube-like interconnection networks
• Conditional matching preclusion for the alternating group graphs and Split-stars
• Conditional matching preclusion sets
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Matching preclusion for some interconnection networks
• Matching preclusion for the (n, k)-bubble-sort graphs
• Perfect matchings after vertex deletions
• Perfect matchings in pruned grid graphs
• Strong matching preclusion

Cited in

(9)

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

This page was built for publication: Strong matching preclusion under the conditional fault model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949116)