Results 11 to 20 of about 292 (214)
Matching preclusion for vertex-transitive networks
Discrete Applied Mathematics, 2016 In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let $G$ be a graph of even order. The matching preclusion number $mp(G)$ is defined as the minimum number of edges whose deletion results in a subgraph without perfect matchings.
Heping Zhang
exaly +3 more sources
Strong matching preclusion for torus networks
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shiying Wang, Kai Feng
exaly +2 more sources
The Conditional Strong Matching Preclusion of Augmented Cubes
Theory and Applications of Graphs, 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 ...
Mohamad Abdallah, Eddie Cheng
doaj +1 more source
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
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
Super edge-connectivity and matching preclusion of data center networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Edge-connectivity is a classic measure for reliability of a network in the presence of edge failures. $k$-restricted edge-connectivity is one of the refined indicators for fault tolerance of large networks.
Huazhong Lü, Tingzeng Wu
doaj +1 more source
Fractional matching preclusion for butterfly derived networks
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 +1 more source
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 +3 more sources
Fractional strong matching preclusion for two variants of hypercubes
Theory and Applications of Graphs, 2019 Let F be a subset of edges and vertices of a graph G. If G-F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G.
Huifen Ge +3 more
doaj +1 more source
Conditional Strong Matching Preclusion of the Alternating Group Graph
Theory and Applications of Graphs, 2019 The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
doaj +1 more source