Results 201 to 210 of about 2,490 (239)

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

Fractional Matching Preclusion for Data Center Networks

Parallel Processing Letters, 2020
An edge subset [Formula: see text] of [Formula: see text] is a fractional matching preclusion set (FMP set for short) if [Formula: see text] has no fractional perfect matchings. The fractional matching preclusion number (FMP number for short) of [Formula: see text], denoted by [Formula: see text], is the minimum size of FMP sets of [Formula: see text].
Bo Zhu, Tianlong Ma, Shuangshuang Zhang, He Zhang   +3 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

Fractional matching preclusion of graphs

Journal of Combinatorial Optimization, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Yan, Liu, Weiwei
openaire   +2 more sources

Matching Preclusion for Exchanged Hypercubes

Journal of Interconnection Networks, 2019
As 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 for Möbius Cubes

Journal of Interconnection Networks, 2019
Let F be an edge subset and F′ a subset of vertices and edges of a graph G. If G − F and G − F′ have no fractional perfect matchings, then F is a fractional matching preclusion (FMP) set and F′ is a fractional strong matching preclusion (FSMP) set of G. The FMP (FSMP) number of G is the minimum size of FMP (FSMP) sets of G. In this paper, we study the
YALAN LI, CHENGFU YE, MIAOLIN WU, PING HAN   +3 more
openaire   +1 more source

Fractional matching preclusion for arrangement graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Tianlong, Mao, Yaping, Cheng, Eddie, Wang, Jinling   +3 more
openaire   +1 more source

Fractional matching preclusion of product networks

Theoretical Computer Science, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Matching preclusion for some interconnection networks

Networks, 2007
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. In this paper, we find this number for various classes of interconnection networks and classify all the optimal solutions. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(2),
Eddie Cheng, László Lipták
openaire   +1 more source

Conditional Matching Preclusion for Folded Hypercubes

Journal of Interconnection Networks, 2019
Let G be a graph with an even number of vertices. The matching preclusion number of G is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching, and the conditional matching preclusion number of G is the minimum number of edges whose deletion results in a graph with no isolated vertices and without a perfect ...
RUIZHI LIN, HEPING ZHANG
openaire   +1 more source