Matching preclusion and conditional matching preclusion for regular interconnection networks
From MaRDI portal
Publication:442207
DOI10.1016/J.DAM.2012.03.040zbMATH Open1246.05126OpenAlexW2034949854MaRDI QIDQ442207FDOQ442207
Authors: Eddie Cheng, Marc J. Lipman, L. Lipták 
Publication date: 10 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.040
Recommendations
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
- Conditional matching preclusion sets
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Matching preclusion for some interconnection networks
- Conditional matching preclusion for Cayley graphs generated by transposition trees
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)
Cites Work
- The Factorization of Linear Graphs
- A new class of interconnection networks based on the alternating group
- Hyper Hamiltonian laceability on edge fault star graph
- 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
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
- Matching preclusion and conditional matching preclusion problems for twisted cubes
- Matching preclusion for the (n, k)-bubble-sort graphs
- Linearly many faults in 2-tree-generated networks
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- The number of labeled k-dimensional trees
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Conditional matching preclusion for the arrangement graphs
- Title not available (Why is that?)
- Properties and characterizations of k ‐trees
- Comparative study of product networks
- Conditional matching preclusion for the alternating group graphs and Split-stars
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
Cited In (45)
- Fractional matching preclusion number of graphs
- Fractional matching preclusion number of graphs and the perfect matching polytope
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- Perfect matchings in highly cyclically connected regular graphs
- Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)
- On anti-Kekulé and \(s\)-restricted matching preclusion problems
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- Matching preclusion for some interconnection networks
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- Matching preclusion for vertex-transitive networks
- A note on the conditional matching preclusion problem of the folded Petersen cube
- Strong matching preclusion for augmented cubes
- Strong matching preclusion for torus networks
- Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph \(P(n,3)\)
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- A brief account on the development and future research directions of connectivity properties of interconnection networks
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- A note on generalized matching preclusion in bipartite graphs
- Matching preclusion for direct product of regular graphs
- Conditional fractional matching preclusion of \(n\)-dimensional torus networks
- Conditional matching preclusion for Cayley graphs generated by transposition trees
- Strong matching preclusion for \(k\)-composition networks
- Matching preclusion number of graphs
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
- Matching preclusion for \(n\)-grid graphs
- The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs
- Matching preclusion and conditional matching preclusion for crossed cubes
- Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
- Matching preclusion number in Cartesian product of graphs and its application to interconnection networks.
- Matching preclusion for cube-connected cycles
- Match algorithms for generalized Rete networks
- Note on matching preclusion number of random graphs
- Relationship between extra edge connectivity and component edge connectivity for regular 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 for the Shuffle-Cubes
- Fault-tolerant maximal local-edge-connectivity of augmented cubes
- Strong matching preclusion number of graphs
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
This page was built for publication: Matching preclusion and conditional matching preclusion for regular interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442207)
