Results 11 to 20 of about 664,357 (236)
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions [PDF]
Networks, 2011 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 induced by
Jia, Roger +7 more
core +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 ...
Haizhen Ren, Jinyu Zou
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.
RANDY JIA, DAVID LU, EDDIE CHENG
core +2 more sources
Conditional Matching Preclusion for the Arrangement Graphs
Theoretical Computer Science, 2011 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 induced by
Lipman, Marc
core +3 more sources
Matching Preclusion for Exchanged Hypercubes
Journal of Interconnection Networks, 2019 As spanning subgraphs of hypercubes, exchanged hypercubes contain less edges but maintain lots of desired properties of hypercubes. This paper considers matching preclusion, a kind of measures of edge-fault tolerance, of exchanged hypercubes EH(s, t). We show that EH(s, t) is maximally matched, that is, for s ≥ t, mp(EH(s, t)) = t + 1 and EH(s, t) is ...
WANTAO NING, QIULI LI
core +2 more sources
Fractional Strong Matching Preclusion for DHcube
Parallel Processing Letters, 2021 Let [Formula: see text] be a set edges and [Formula: see text] be a set of edges and/or vertices of a graph [Formula: see text], then [Formula: see text] (resp. [Formula: see text]) is a fractional matching preclusion set (resp. fractional strong matching preclusion set) if [Formula: see text] (resp. [Formula: see text]) contains no fractional perfect
He Zhang +3 more
core +3 more sources
RAIRO - Operations ResearchAs a generalization of matching preclusion number of a graph, we provide the (strong) integer k-matching preclusion number, abbreviated as MPk number (SMPk number), which is the minimum number of edges (vertices and edges) whose deletion results in a ...
Yan Liu, Caibing Chang
core +3 more sources
The Matching Preclusion of Enhanced Hypercubes
The Computer Journal, 2021 Abstract The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves the resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings. The (conditional) strong matching preclusion number of a graph is the minimum number of vertices and edges ...
Shiying Wang, Xiaolei Ma
openaire +1 more source
Fractional matching preclusion number of graphs [PDF]
Discrete Applied Mathematics, 2022 The \emph{fractional matching preclusion number} of a graph $G$, denoted by $fmp(G)$, is the minimum number of edges whose deletion results in a graph that has no fractional perfect matchings. In this paper, we first give some sharp upper and lower bounds of fractional matching preclusion number.
Jinyu Zou +3 more
openaire +4 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