Results 11 to 20 of about 130 (91)
Fractional matching preclusion for generalized augmented cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The \emph{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.
Tianlong Ma +3 more
doaj +2 more sources
Fractional matching preclusion for butterfly derived networks [PDF]
Theory and Applications of Graphs, 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.
Xia Wang +4 more
doaj +3 more sources
Strong matching preclusion for k-ary n-cubes
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shiying Wang, Guozhen Zhang, Kai Feng
exaly +3 more sources
Strong matching preclusion of (n,k)-star graphs
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Justin Kelm, Eddie Cheng
exaly +3 more sources
Strong Matching Preclusion for Augmented Butterfly Networks [PDF]
American Journal of Applied Mathematics, 2019 Jinyu Zou, Yan Sun, Chengfu Ye
exaly +2 more sources
Fractional strong matching preclusion of some Cartesian product graphs
Journal of Physics: Conference Series, 2021 Abstract The fractional strong matching preclusion number of a graph is the minimum number of edges and vertices whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the fractional strong matching preclusion number for the Cartesian product of a graph and a cycle.
Bo Zhu, Shumin Zhang, Chenfu Ye
openaire +2 more sources
Strong matching preclusion for augmented cubes
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eddie Cheng 0001 +3 more
openaire +2 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
Matching preclusion and strong matching preclusion of the bubble-sort star graphs
, 2020 Since a plurality of processors in a distributed computer system working in parallel, to ensure the fault tolerance and stability of the network is an important issue in distributed systems. As the topology of the distributed network can be modeled as a graph, the (strong) matching preclusion in graph theory can be used as a robustness measure for ...
Wang, Xin, Ma, Chaoqun, Guo, Jia
openaire +2 more sources
Fractional Strong Matching Preclusion of Split-Star Networks
Journal of Mathematics Research, 2019 The matching preclusion number of graph G is the minimum size of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching. Let F be an edge subset and F′ be a subset of edges and vertices of a graph G. If G − F and G − F′ have no fractional matching preclusion, then
Ping Han, Yuzhi Xiao, Chengfu Ye, He Li
openaire +2 more sources