Results 1 to 10 of about 2,371 (120)
Integer k-matching preclusion of graphs
RAIRO - Operations Research, 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 ...
Chang, Caibing, Liu, Yan
core +2 more sources
Generalized Matching Preclusion in Bipartite Graphs [PDF]
Theory and Applications of Graphs, 2018 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 that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Cheng, Eddie +4 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 ...
Jinyu Zou, Haizhen Ren
openaire +2 more sources
Conditional Matching Preclusion Number of Graphs
Discrete Dynamics in Nature and Society, 2023 The conditional matching preclusion number of a graph G , denoted by m p
Yalan Li, Shumin Zhang, Chengfu Ye
openaire +2 more sources
The Conditional Strong Matching Preclusion of Augmented Cubes [PDF]
, 2021 The strong matching preclusion is a measure for the robustness of interconnection networks in the presence of node and/or link failures. However, in the case of random link and/or node failures, it is unlikely to find all the faults incident and/or ...
Abdallah, Mohamad, Cheng, Eddie
core +2 more sources
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.
Cheng, Eddie +3 more
openaire +3 more sources
Robust Assignments via Ear Decompositions and Randomized Rounding [PDF]
, 2016 Many real-life planning problems require making a priori decisions before all parameters of the problem have been revealed. An important special case of such problem arises in scheduling problems, where a set of tasks needs to be assigned to the ...
Adjiashvili, David +2 more
core +2 more sources
Matching preclusion and conditional matching preclusion for regular interconnection networks
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, Eddie +2 more
openaire +1 more source
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Park, Jung-Heum, Ihm, Insung
openaire +1 more source
Matching preclusion number of graphs [PDF]
Theoretical Computer Science, 2019 23 ...
Zhao Wang +3 more
openaire +2 more sources