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

DOI10.1016/J.TCS.2015.01.046MaRDI QIDQ2344732zbMATH OpenOpenAlexFDO

Authors 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

conditional matching preclusionfolded Petersen cubematching preclusionperfect matching

Mathematics Subject Classification ID

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

Recommendations

• A note on the conditional matching preclusion problem of the folded Petersen cube
• Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph P(n,3)
• Matching preclusion of the generalized Petersen graph
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion and conditional matching preclusion for regular interconnection networks

Cites work

• Conditional matching preclusion for hypercube-like interconnection networks
• Conditional matching preclusion for the alternating group graphs and Split-stars
• Conditional matching preclusion sets
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
• scientific article; zbMATH DE number 5016662 (Why is no real title available?)
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Matching preclusion for balanced hypercubes
• Matching preclusion for some interconnection networks
• The Factorization of Linear Graphs

Cited in

(22)

• Strong matching preclusion number of graphs
• Matching preclusion number of graphs
• Matching preclusion number in product graphs
• Conditional matching preclusion for regular bipartite graphs and their Cartesian product
• Fractional matching preclusion number of graphs
• The fractional matching preclusion number of complete n-balanced k-partite graphs
• 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 for cube-connected cycles
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• A note on the conditional matching preclusion problem of the folded Petersen cube
• scientific article; zbMATH DE number 6000733 (Why is no real title available?)
• Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph P(n,3)
• Matching preclusion of the generalized Petersen graph
• 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 for folded hypercubes
• Higher order matching preclusion for regular interconnection networks
• Conditional fractional matching preclusion number of graphs
• Note on matching preclusion number of random graphs

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

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