Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions [PDF]
Networks, 2011 AbstractThe matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost‐perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex.
Eddie Cheng 0001 +3 more
openaire +5 more sources
Matching preclusion and conditional matching preclusion for hierarchical cubic networks
AIMS Mathematics, 2022 <abstract><p>Matching preclusion originates from the measurement of interconnection network robustness in the event of edge failure. Conditional matching preclusion belongs to generalized matching preclusion. We obtain the matching preclusion number and conditional matching preclusion number for hierarchical cubic network($ HCN_n ...
Jinyu Zou, Haizhen Ren
openaire +3 more sources
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eddie Cheng 0001 +3 more
core +3 more sources
MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES
Journal of Interconnection Networks, 2010 The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those incident to a single vertex.
Eddie Cheng 0001, Randy Jia, David Lu
openaire +2 more sources
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper‐stars [PDF]
Networks, 2011 AbstractThe matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex.
Eddie Cheng 0001 +3 more
openaire +6 more sources
Conditional matching preclusion for the alternating group graphs and split-stars
International Journal of Computer Mathematics, 2011 The matching preclusion number of a graph is the minimum number of edges the deletion of which results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex.
Eddie Cheng 0001 +3 more
openaire +2 more sources
A Visual Dive into Conditional Flow Matching
https://iclr-blogposts.github.io/2025/blog/conditional-flow-matching/Conditional flow matching (CFM) was introduced by three simultaneous papers at ICLR 2023, through different approaches (conditional matching, rectifying flows and stochastic ...
Martin, Ségolène +4 more
core +16 more sources
Integer k-matching preclusion of graphs [PDF]
, 2023 As a generalization of matching preclusion number of a graph, we provide the (strong) integer $k$-matching preclusion number, abbreviated as $MP^{k}$ number ($SMP^{k}$ number), which is the minimum number of edges (vertices and edges) whose deletion ...
Liu, Yan, Chang, Caibing
core +1 more source
Fractional matching preclusion for butterfly derived networks [PDF]
, 2019 The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Ye, Chengfu +4 more
core +1 more source
Matching Preclusion of the Generalized Petersen Graph [PDF]
, 2019 The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph with no perfect matchings.
Arora, Ajay +2 more
core +1 more source