Matching preclusion and conditional matching preclusion for regular interconnection networks
From MaRDI portal
Publication:442207
DOI10.1016/j.dam.2012.03.040zbMath1246.05126OpenAlexW2034949854MaRDI QIDQ442207
Eddie Cheng, László Lipták, Marc J. Lipman
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
Network design and communication in computer systems (68M10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (30)
Matching preclusion for vertex-transitive networks ⋮ Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks ⋮ The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ Conditional fractional matching preclusion of \(n\)-dimensional torus networks ⋮ Matching Preclusion for the Shuffle-Cubes ⋮ Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Strong matching preclusion for augmented cubes ⋮ Strong matching preclusion for torus networks ⋮ On anti-Kekulé and \(s\)-restricted matching preclusion problems ⋮ Perfect matchings in highly cyclically connected regular graphs ⋮ Fractional matching preclusion numbers of Cartesian product graphs ⋮ Strong matching preclusion number of graphs ⋮ Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs ⋮ Matching preclusion number of graphs ⋮ The (conditional) matching preclusion for burnt pancake graphs ⋮ Strong matching preclusion for \(k\)-ary \(n\)-cubes ⋮ The fractional (strong) matching preclusion number of complete \(k\)-partite graph ⋮ CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS ⋮ Matching preclusion for \(n\)-grid graphs ⋮ Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\) ⋮ A note on generalized matching preclusion in bipartite graphs ⋮ 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 ⋮ Relationship between extra edge connectivity and component edge connectivity for regular graphs ⋮ Matching preclusion for cube-connected cycles ⋮ Matching preclusion for \(n\)-dimensional torus networks
Cites Work
- Unnamed Item
- Unnamed Item
- 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 for the arrangement graphs
- Hyper Hamiltonian laceability on edge fault star graph
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Comparative study of product networks
- 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
- Conditional matching preclusion for the alternating group graphs and split-stars
- Matching preclusion for the (n, k)-bubble-sort graphs
- Linearly many faults in 2-tree-generated networks
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- A new class of interconnection networks based on the alternating group
- Matching preclusion for some interconnection networks
- The number of labeled k-dimensional trees
- Properties and characterizations of k ‐trees
- The Factorization of Linear Graphs
This page was built for publication: Matching preclusion and conditional matching preclusion for regular interconnection networks
