Matching preclusion and conditional matching preclusion problems for the folded Petersen cube

DOI10.1016/j.tcs.2015.01.046zbMath1311.05161OpenAlexW2064222416MaRDI QIDQ2344732

Eddie Cheng, Robert Connolly, Christoper Melekian

Publication date: 18 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.046

zbMATH Keywords

perfect matchingmatching preclusionconditional matching preclusionfolded Petersen cube

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (14)

The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs ⋮ On anti-Kekulé and \(s\)-restricted matching preclusion problems ⋮ Conditional matching preclusion number of graphs ⋮ Fractional matching preclusion numbers of Cartesian product graphs ⋮ Strong matching preclusion number of graphs ⋮ Matching preclusion number of graphs ⋮ Matching preclusion number in product graphs ⋮ The fractional (strong) matching preclusion number of complete \(k\)-partite graph ⋮ Conditional matching preclusion for regular bipartite graphs and their Cartesian product ⋮ Matching preclusion for direct product of regular graphs ⋮ Fractional matching preclusion number of graphs and the perfect matching polytope ⋮ Fractional matching preclusion number of graphs ⋮ Note on matching preclusion number of random graphs

Cites Work

• Unnamed Item
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• Matching preclusion for balanced hypercubes
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
• Conditional matching preclusion for the alternating group graphs and split-stars
• Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Matching preclusion for some interconnection networks
• The Factorization of Linear Graphs

This page was built for publication: Matching preclusion and conditional matching preclusion problems for the folded Petersen cube