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.05175MaRDI QIDQ444435
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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C76: Graph operations (line graphs, products, etc.)
Related Items
Strong matching preclusion for two-dimensional torus networks, THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS, On anti-Kekulé and \(s\)-restricted matching preclusion problems, Fractional matching preclusion numbers of Cartesian product graphs, An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes, Integer \(k\)-matching preclusion of some interconnection networks, Strong matching preclusion for \(n\)-dimensional torus networks, Matching preclusion for vertex-transitive networks, Strong matching preclusion for torus networks, Matching preclusion and conditional matching preclusion for regular interconnection networks, Note on matching preclusion number of random graphs, Matching preclusion number in product graphs, Matching preclusion for \(n\)-grid graphs, Matching preclusion for balanced hypercubes, Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\), Conditional matching preclusion for regular bipartite graphs and their Cartesian product, The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs, Fractional matching preclusion of product networks, The fractional (strong) matching preclusion number of complete \(k\)-partite graph, Matching preclusion for direct product of regular graphs, 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 for cube-connected cycles, Matching preclusion for \(n\)-dimensional torus networks, Strong matching preclusion for non-bipartite torus networks, Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs, The (conditional) matching preclusion for burnt pancake graphs, Strong matching preclusion for \(k\)-ary \(n\)-cubes, Conditional fractional matching preclusion of \(n\)-dimensional torus networks
Cites Work
- Unnamed Item
- Unnamed Item
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Strong matching preclusion
- 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
- Matching preclusion for some interconnection networks
