Results 251 to 260 of about 22,452 (283)

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
Cheng, Eddie, Padmanabhan, Sachin
openaire   +2 more sources

Fractional Strong Matching Preclusion for DHcube

Parallel Processing Letters, 2021
Let [Formula: see text] be a set edges and [Formula: see text] be a set of edges and/or vertices of a graph [Formula: see text], then [Formula: see text] (resp. [Formula: see text]) is a fractional matching preclusion set (resp. fractional strong matching preclusion set) if [Formula: see text] (resp. [Formula: see text]) contains no fractional perfect
He Zhang, Jinyu Zou, Shuangshuang Zhang, Chengfu Ye   +3 more
openaire   +2 more sources

MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES

Journal of Interconnection Networks, 2010
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 incident to a single vertex.
EDDIE CHENG, RANDY JIA, DAVID LU
openaire   +1 more source

Preclusivity and Simple Graphs

2015
The adjacency relation of a simple undirected graph is a preclusive (irreflexive and symmetric) relation. Hence, it originates a preclusive space enabling us to define the lower and upper preclusive approximations of graphs and two orthogonality graphs.
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, Federico Infusino   +3 more
openaire   +3 more sources

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).
Cheng, Eddie, Lesniak, Linda, Lipman, Marc J., Lipták, László   +3 more
openaire   +1 more source

Matching Preclusion for the Shuffle-Cubes

Parallel Processing Letters, 2018
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. 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 ...
Antantapantula, Sai, Melekian, Christopher, Cheng, Eddie   +2 more
openaire   +1 more source

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, Philip Hu, Roger Jia, László Lipták, Brian Scholten, James Voss   +5 more
openaire   +1 more source