Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
DOI10.1016/J.TCS.2015.01.046zbMATH Open1311.05161OpenAlexW2064222416MaRDI QIDQ2344732FDOQ2344732
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
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- The Factorization of Linear Graphs
- Matching preclusion for balanced hypercubes
- Title not available (Why is that?)
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion for some interconnection networks
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
- Conditional matching preclusion for the alternating group graphs and Split-stars
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
Cited In (19)
- Fractional matching preclusion number of graphs
- Fractional matching preclusion number of graphs and the perfect matching polytope
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- On anti-Kekulé and \(s\)-restricted matching preclusion problems
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- 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)\)
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- Matching preclusion for direct product of regular graphs
- Matching preclusion number of graphs
- The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs
- Title not available (Why is that?)
- Matching preclusion for cube-connected cycles
- Conditional matching preclusion number of graphs
- Note on matching preclusion number of random graphs
- Fractional matching preclusion numbers of Cartesian product graphs
- Strong matching preclusion number of graphs
- Matching preclusion number in product graphs
- Matching preclusion of the generalized Petersen graph
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)
