Results 191 to 200 of about 292 (214)

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

Strong Matching Preclusion of Arrangement Graphs

Journal of Interconnection Networks, 2016
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph with neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm.
Eddie Cheng 0001, Omer Siddiqui
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

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 Enhanced Pyramid Networks

Journal of Interconnection Networks, 2019
The matching preclusion number of a graph is the minimum number of edges whose deletion leaves the resulting graph that has neither perfect matchings nor almost perfect matchings. This concept was introduced as a measure of robustness in the event of edge failure in interconnection networks. The pyramid network is one of the important networks applied
Xiaqi Wei, Shurong Zhang, Weihua Yang
openaire   +1 more source

STRONG MATCHING PRECLUSION OF PANCAKE GRAPHS

Journal of Interconnection Networks, 2013
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm.
Eddie Cheng 0001, David Lu, Brian Xu
openaire   +1 more source

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 0001, László Lipták
openaire   +1 more source

Matching preclusion for direct product of regular graphs

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruizhi Lin, Heping Zhang, Weisheng Zhao 0002   +2 more
openaire   +2 more sources

MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS

International Journal of Foundations of Computer Science, 2008
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. In this paper, we find this number for the alternating group graphs, Cayley graphs generated by 2-trees and the (n,k)-arrangement graphs.
Eddie Cheng 0001, Linda M. Lesniak, Marc J. Lipman, László Lipták   +3 more
openaire   +1 more source

Strong matching preclusion of burnt pancake graphs

International Journal of Parallel, Emergent and Distributed Systems, 2015
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm.
Eddie Cheng 0001, Justin Kelm, Roi Orzach, Brian Xu   +3 more
openaire   +1 more source