Matching preclusion and conditional matching preclusion for regular interconnection networks
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 5016662 (Why is no real title available?)
- scientific article; zbMATH DE number 3390835 (Why is no real title available?)
- A new class of interconnection networks based on the alternating group
- Comparative study of product networks
- Conditional matching preclusion for hypercube-like interconnection networks
- Conditional matching preclusion for the alternating group graphs and Split-stars
- Conditional matching preclusion for the arrangement graphs
- Conditional matching preclusion sets
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- Hyper Hamiltonian laceability on edge fault star graph
- Linearly many faults in 2-tree-generated networks
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- 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 tori and related Cartesian products
- Matching preclusion and conditional matching preclusion problems for twisted cubes
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Matching preclusion for some interconnection networks
- Matching preclusion for the (n, k)-bubble-sort graphs
- Properties and characterizations of k ‐trees
- The Factorization of Linear Graphs
- The number of labeled k-dimensional trees
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
- Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)
- Perfect matchings in highly cyclically connected regular graphs
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- Matching preclusion for vertex-transitive networks
- Strong matching preclusion for augmented cubes
- Strong matching preclusion for torus networks
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- On anti-Kekulé and \(s\)-restricted matching preclusion problems
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- A note on the conditional matching preclusion problem of the folded Petersen cube
- Matching preclusion for some interconnection networks
- Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph \(P(n,3)\)
- 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
- Matching preclusion for n-grid graphs
- The fractional matching preclusion number of complete n-balanced k-partite graphs
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
- Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
- Matching preclusion and conditional matching preclusion for crossed cubes
- Matching preclusion number in Cartesian product of graphs and its application to interconnection networks.
- Matching preclusion for cube-connected cycles
- Note on matching preclusion number of random graphs
- Relationship between extra edge connectivity and component edge connectivity for regular graphs
- Match algorithms for generalized Rete networks
- Matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- The (conditional) matching preclusion for burnt pancake graphs
- Fractional matching preclusion numbers of Cartesian product graphs
- Strong matching preclusion number of graphs
- Matching Preclusion for the Shuffle-Cubes
- Fault-tolerant maximal local-edge-connectivity of augmented 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
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)
