Matching preclusion for vertex-transitive networks
نویسندگان
چکیده
منابع مشابه
Matching preclusion for vertex-transitive networks
In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let G be a graph of even order. The matching preclusion number mp(G) is defined as the minimum number of edges whose deletion results in a subgraph without perfect matchings. Many interconnection networks are super matched, that is, their optimal matching preclusion sets are precisely those...
متن کاملStrong matching preclusion for torus networks
a r t i c l e i n f o a b s t r a c t The torus network is one of the most popular interconnection network topologies for massively parallel computing systems. Strong matching preclusion that additionally permits more destructive vertex faults in a graph is a more extensive form of the original matching preclusion that assumes only edge faults. In this paper, we establish the strong matching pr...
متن کاملMatching preclusion and Conditional Matching preclusion for Crossed Cubes
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 inci...
متن کاملMatching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
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 indu...
متن کاملConditional matching preclusion for hypercube-like interconnection networks
The conditional matching preclusion number of a graph with n vertices is the minimum number of edges whose deletion results in a graph without an isolated vertex that does not have a perfect matching if n is even, or an almost perfect matching if n is odd. We develop some general properties on conditional matching preclusion and then analyze the conditional matching preclusion numbers for some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.02.001