Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
From MaRDI portal
Publication:444435
DOI10.1016/J.DAM.2012.03.014zbMATH Open1244.05175OpenAlexW2029233323MaRDI QIDQ444435FDOQ444435
Authors: Eddie Cheng, L. Lipták 
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
Recommendations
- Matching preclusion and conditional matching preclusion problems for twisted cubes
- Conditional matching preclusion sets
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph \(P(n,3)\)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Matching preclusion for some interconnection networks
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Strong matching preclusion
- Matching preclusion and conditional matching preclusion problems for twisted cubes
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Conditional matching preclusion for the alternating group graphs and Split-stars
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
Cited In (32)
- An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes
- Fractional matching preclusion number of graphs and the perfect matching polytope
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)
- On anti-Kekulé and \(s\)-restricted matching preclusion problems
- Strong matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for two-dimensional torus networks
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- Matching preclusion for vertex-transitive networks
- Strong matching preclusion for torus networks
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS
- Matching preclusion for direct product of regular graphs
- Conditional fractional matching preclusion of \(n\)-dimensional torus networks
- Integer \(k\)-matching preclusion of some interconnection networks
- Matching preclusion for balanced hypercubes
- Matching preclusion for \(n\)-grid graphs
- Matching preclusion and conditional matching preclusion problems for twisted cubes
- The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs
- Fractional matching preclusion of product networks
- Matching preclusion for cube-connected cycles
- Note on matching preclusion number of random graphs
- Matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Fractional matching preclusion numbers of Cartesian product graphs
- The (conditional) matching preclusion for burnt pancake graphs
- Matching preclusion number in product graphs
- Conditional \(k\)-matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for non-bipartite torus networks
This page was built for publication: Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444435)
