Results 151 to 160 of about 910,618 (173)

Conditional Matching Preclusion Sets

Information Sciences, 2009
The 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).
László Lipták, Eddie Cheng, Linda Leśniak   +2 more
exaly   +2 more sources

Conditional Matching Preclusion for Hypercube-Like Interconnection Networks

Theoretical Computer Science, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jung-Heum Park, Sang Hyuk Son
exaly   +2 more sources

MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES

Parallel Processing Letters, 2012
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 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 and Conditional Edge-Fault Hamiltonicity of Binary De Bruijn Graphs

Discrete Applied Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang, Ruizhi Lin
exaly   +4 more sources

Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs

International Journal of Parallel, Emergent and Distributed Systems, 2013
The 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, Philip Hu, Roger Jia, László Lipták, Brian Scholten, James R. Voss   +5 more
openaire   +1 more source

Conditional K-Matching Preclusion for N-Dimensionaltorus Networks

2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaomin Hu, Xiangyu Ren, Weihua Yang
openaire   +3 more sources

Conditional fractional matching preclusion of n-dimensional torus networks

Discrete Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaomin Hu, Yingzhi Tian, Jixiang Meng, Weihua Yang   +3 more
openaire   +3 more sources

Conditional Matching Preclusion of Enhanced Hypercubes

Discrete Applied Mathematics
Weihua Yang, Xiaomin Hu
exaly   +2 more sources

Conditional Matching Preclusion Sets for an Mixed-Graph of the Star Graph and the Bubble-Sort Graph

Lecture Notes in Computer Science, 2015
The conditional matching preclusion number of a graph is the minimum number of edges, whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. Any such optimal set is called an optimally conditional matching preclusion set.
Shiying Wang
exaly   +3 more sources

Conditional Fractional Matching Preclusion Number of Graphs

International Journal of Foundations of Computer Science
The conditional fractional matching preclusion number (CFMP number for short) [Formula: see text] of a graph [Formula: see text] is the minimum number of edges whose deletion results in a graph without isolated vertices and without fractional perfect matchings.
Yaping Mao, Liu Yuhu, Eddie Cheng
exaly   +3 more sources