A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs

2020 ◽  
Vol 30 (01) ◽  
pp. 2050001
Author(s):  
Shuangshuang Zhang ◽  
Yuzhi Xiao ◽  
Xia Liu ◽  
Jun Yin
Keyword(s):  
Short Note ◽  
Perfect Matchings ◽  
Minimum Number ◽  
Edge Failure

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. The strong matching preclusion is a well-studied measure for the network invulnerability in the event of edge failure. In this paper, we obtain the strong matching preclusion number for a class of arrangement graphs and categorize their the strong matching preclusion set, which are a supplement of known results.

Matching Preclusion for Enhanced Pyramid Networks

2019 ◽  
Vol 19 (03) ◽  
pp. 1940009
Author(s):  
XIAQI WEI ◽  
SHURONG ZHANG ◽  
WEIHUA YANG
Keyword(s):  
Interconnection Networks ◽  
Computer Systems ◽  
Perfect Matchings ◽  
Minimum Number ◽  
Edge Failure ◽  
Distributed Computer Systems

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 in parallel and distributed computer systems. Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid network, by replacing each mesh in a pyramid network with a torus. An enhanced pyramid network of n layers is denoted by EPM(n). In this paper, we prove that the matching preclusion number of EPM(n) is 9 where n ≥ 4.

MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES

2012 ◽  
Vol 22 (02) ◽  
pp. 1250005 ◽  
Author(s):  
EDDIE CHENG ◽  
SACHIN PADMANABHAN
Keyword(s):  
Interconnection Networks ◽  
Perfect Matchings ◽  
Single Vertex ◽  
Minimum Number ◽  
Important Variant

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 look for obstruction sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In this paper, we find the matching preclusion number and the conditional matching preclusion number with the classification of the optimal sets for the class of crossed cubes, an important variant of the class of hypercubes. Indeed, we will establish more general results on the matching preclusion and the conditional matching preclusion problems for a larger class of interconnection networks.

MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES

2010 ◽  
Vol 11 (01n02) ◽  
pp. 35-60 ◽  
Author(s):  
EDDIE CHENG ◽  
RANDY JIA ◽  
DAVID LU
Keyword(s):  
Interconnection Networks ◽  
Perfect Matchings ◽  
Single Vertex ◽  
Minimum Number

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. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those incident to a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number and classify all optimal sets for the augmented cubes, a class of networks designed as an improvement of the hypercubes.

scholarly journals A note on bipartite graphs whose [1,k]-domination number equal to their number of vertices

2020 ◽  
Vol 40 (3) ◽  
pp. 375-382
Author(s):  
Narges Ghareghani ◽  
Iztok Peterin ◽  
Pouyeh Sharifani
Keyword(s):  
Decision Problem ◽  
Dominating Set ◽  
Domination Number ◽  
Short Note ◽  
Bipartite Graphs ◽  
Hard Problem ◽  
Simple Construction ◽  
Minimum Number ◽  
Vertex Set ◽  
Np Hard Problem

A subset \(D\) of the vertex set \(V\) of a graph \(G\) is called an \([1,k]\)-dominating set if every vertex from \(V-D\) is adjacent to at least one vertex and at most \(k\) vertices of \(D\). A \([1,k]\)-dominating set with the minimum number of vertices is called a \(\gamma_{[1,k]}\)-set and the number of its vertices is the \([1,k]\)-domination number \(\gamma_{[1,k]}(G)\) of \(G\). In this short note we show that the decision problem whether \(\gamma_{[1,k]}(G)=n\) is an \(NP\)-hard problem, even for bipartite graphs. Also, a simple construction of a bipartite graph \(G\) of order \(n\) satisfying \(\gamma_{[1,k]}(G)=n\) is given for every integer \(n \geq (k+1)(2k+3)\).

Fractional Matching Preclusion for (n, k)-Star Graphs

2018 ◽  
Vol 28 (04) ◽  
pp. 1850017 ◽  
Author(s):  
Tianlong Ma ◽  
Yaping Mao ◽  
Eddie Cheng ◽  
Jinling Wang
Keyword(s):  
Perfect Matching ◽  
Perfect Matchings ◽  
Star Graphs ◽  
Minimum Number ◽  
Fractional Perfect Matching

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. As a generalization, Liu and Liu introduced the concept of fractional matching preclusion number in 2017. The Fractional Matching Preclusion Number (FMP number) of G is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The Fractional Strong Matching Preclusion Number (FSMP number) of G is the minimum number of vertices and/or edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the FMP number and the FSMP number for (n, k)-star graphs. In addition, all the optimal fractional strong matching preclusion sets of these graphs are categorized.

A Concise Survey of Matching Preclusion in Interconnection Networks

2019 ◽  
Vol 19 (03) ◽  
pp. 1940006 ◽  
Author(s):  
YAPING MAO ◽  
EDDIE CHENG
Keyword(s):  
Interconnection Networks ◽  
Perfect Matchings ◽  
Minimum Number ◽  
General Topic

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. There are other related parameters and generalization including the strong matching preclusion number, the conditional matching preclusion number, the fractional matching preclusion number, and so on. In this survey, we give an introduction on the general topic of matching preclusion.

Strong Matching Preclusion of Arrangement Graphs

2016 ◽  
Vol 16 (02) ◽  
pp. 1650004 ◽  
Author(s):  
EDDIE CHENG ◽  
OMER SIDDIQUI
Keyword(s):  
Interconnection Networks ◽  
Perfect Matchings ◽  
Alternating Group ◽  
Star Graphs ◽  
Common Generalization ◽  
Minimum Number

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. The class of arrangement graphs was introduced as a common generalization of the star graphs and alternating group graphs, and to provide an even richer class of interconnection networks. In this paper, the goal is to find the strong matching preclusion number of arrangement graphs and to categorize all optimal strong matching preclusion sets of these graphs.

STRONG MATCHING PRECLUSION FOR THE ALTERNATING GROUP GRAPHS AND SPLIT-STARS

2011 ◽  
Vol 12 (04) ◽  
pp. 277-298 ◽  
Author(s):  
PHILIP BONNEVILLE ◽  
EDDIE CHENG ◽  
JOSEPH RENZI
Keyword(s):  
General Result ◽  
Cartesian Product ◽  
Perfect Matchings ◽  
Alternating Group ◽  
Optimal Solutions ◽  
Minimum Number

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 and has recently been introduced by Park and Ihm.15 In this paper, we examine properties of strong matching preclusion for alternating group graphs, by finding their strong matching preclusion numbers and categorizing all optimal solutions. More importantly, we prove a general result on taking a Cartesian product of a graph with K2 (an edge) to obtain the corresponding results for split-stars.

CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS

2013 ◽  
Vol 23 (01) ◽  
pp. 1350004 ◽  
Author(s):  
EDDIE CHENG ◽  
LÁSZLÓ LIPTÁK
Keyword(s):  
Interconnection Networks ◽  
Perfect Matchings ◽  
Optimal Solutions ◽  
Alternate Proof ◽  
Star Graphs ◽  
Minimum Number

The matching preclusion number of an even graph G, denoted by mp (G), is the minimum number of edges whose deletion leaves the resulting graph without perfect matchings. The conditional matching preclusion number of an even graph G, denoted by mp 1(G), is the minimum number of edges whose deletion leaves the resulting graph with neither perfect matchings nor isolated vertices. The class of (n,k)-star graphs is a popular class of interconnection networks for which the matching preclusion number and the classification of the corresponding optimal solutions were known. However, the conditional version of this problem was open. In this paper, we determine the conditional matching preclusion for (n,k)-star graphs as well as classify the corresponding optimal solutions via several new results. In addition, an alternate proof of the results on the matching preclusion problem will also be given.

scholarly journals Fractional Matching Preclusion for Restricted Hypercube-Like Graphs

2019 ◽  
Vol 19 (03) ◽  
pp. 1940010
Author(s):  
HUAZHONG LÜ ◽  
TINGZENG WU
Keyword(s):  
Interconnection Networks ◽  
Perfect Matching ◽  
Parallel Systems ◽  
Perfect Matchings ◽  
Minimum Number ◽  
Fractional Perfect Matching

The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the graph with neither perfect matchings nor almost perfect matchings. The fractional perfect matching preclusion and fractional strong perfect matching preclusion are generalizations of the matching preclusion. In this paper, we obtain fractional matching preclusion number and fractional strong matching preclusion number of restricted hypercube-like graphs, which extend some known results.

Sign in / Sign up

Export Citation Format

Share Document