Results 241 to 250 of about 2,866 (282)
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 0001, Randy Jia, David Lu
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guozhen Zhang
exaly +2 more sources
Fractional matching preclusion for arrangement graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tianlong Ma, Yaping Mao, Eddie Cheng
exaly +2 more sources
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 +2 more sources
Preclusivity and Simple Graphs
2015The 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 +3 more
openaire +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 +1 more source
Fractional Strong Matching Preclusion for DHcube
Parallel Processing Letters, 2021Let [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 +3 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 Exchanged Hypercubes
Journal of Interconnection Networks, 2019As spanning subgraphs of hypercubes, exchanged hypercubes contain less edges but maintain lots of desired properties of hypercubes. This paper considers matching preclusion, a kind of measures of edge-fault tolerance, of exchanged hypercubes EH(s, t). We show that EH(s, t) is maximally matched, that is, for s ≥ t, mp(EH(s, t)) = t + 1 and EH(s, t) is ...
Qiuli Li, Wantao Ning
openaire +1 more source
Fractional matching preclusion of graphs
Journal of Combinatorial Optimization, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Liu, Weiwei Liu
openaire +2 more sources