Results 201 to 210 of about 664,357 (236)
Matching Preclusion for Balanced Hypercubes
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang, Xianyue Li, Huazhong Lu
exaly +2 more sources
Matching Preclusion Number of Graphs [PDF]
Theoretical Computer Science, 2019 23 ...
Yaping Mao, Eddie Cheng
exaly +3 more sources
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
László Lipták, Eddie Cheng
exaly +3 more sources
Some of the next articles are maybe not open access.
MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
Parallel Processing Letters, 2012The 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. Recently, the conditional matching preclusion number of a graph was introduced to
Eddie Cheng 0001, Sachin Padmanabhan
openaire +3 more sources
Matching Preclusion for Cube-Connected Cycles
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wai-Chee Shiu, Haiyuan Yao, Qiuli Li
exaly +3 more sources
Matching Preclusion for the Shuffle-Cubes
Parallel Processing Letters, 2018The 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. A graph is maximally matched if its matching preclusion number is equal to its minimum degree, and is super matched if the matching preclusion number can only be achieved by ...
Sai Antantapantula +2 more
openaire +2 more sources
Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs
International Journal of Parallel, Emergent and Distributed Systems, 2013The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion destroys all perfect matchings in the graph. The optimal matching preclusion sets are often precisely those which are induced by a single vertex of minimum degree.
Eddie Cheng 0001 +5 more
openaire +1 more source
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, Qiuli Li
exaly +3 more sources
Fractional matching preclusion of graphs
Journal of Combinatorial Optimization, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Liu, Weiwei Liu
openaire +3 more sources
Conditional matching preclusion sets
Information Sciences, 2009The matching preclusion concept was introduced as a measure of robustness in interconnection networks. A desired property is that the only minimum way to preclude a perfect (respectively, almost-perfect) matching is to delete all edges incident to a single vertex (respectively, all edges incident to two vertices).
Eddie Cheng 0001 +3 more
openaire +1 more source