Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products

From MaRDI portal
Publication:444435

DOI10.1016/j.dam.2012.03.014zbMath1244.05175OpenAlexW2029233323MaRDI QIDQ444435

László Lipták, Eddie Cheng

Publication date: 14 August 2012

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

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




Related Items (29)

Strong matching preclusion for \(n\)-dimensional torus networksMatching preclusion for vertex-transitive networksThe fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphsStrong matching preclusion for non-bipartite torus networksConditional fractional matching preclusion of \(n\)-dimensional torus networksMatching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphsStrong matching preclusion for torus networksMatching preclusion for balanced hypercubesOn anti-Kekulé and \(s\)-restricted matching preclusion problemsFractional matching preclusion numbers of Cartesian product graphsAn Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced HypercubesInteger \(k\)-matching preclusion of some interconnection networksMatching preclusion and conditional matching preclusion for regular interconnection networksFractional matching preclusion of product networksThe (conditional) matching preclusion for burnt pancake graphsStrong matching preclusion for \(k\)-ary \(n\)-cubesMatching preclusion number in product graphsTHE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTSThe fractional (strong) matching preclusion number of complete \(k\)-partite graphMatching preclusion for \(n\)-grid graphsMatching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)Conditional matching preclusion for regular bipartite graphs and their Cartesian productMatching preclusion for direct product of regular graphsFractional matching preclusion number of graphs and the perfect matching polytopeNote on matching preclusion number of random graphsStrong matching preclusion for two-dimensional torus networksMatching preclusion and conditional matching preclusion problems for the folded Petersen cubeMatching preclusion for cube-connected cyclesMatching preclusion for \(n\)-dimensional torus networks



Cites Work


This page was built for publication: Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products