Fractional strong matching preclusion for two variants of hypercubes

Abstract

Let F be a subset of edges and vertices of a graph G. If G-F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G. The fractional strong matching preclusion number is the cardinality of a minimum fractional strong matching preclusion set. In this paper, we mainly study the fractional strong matching preclusion problem for two variants of hypercubes, the multiply twisted cube and the locally twisted cube, which are two of the most popular interconnection networks. In addition, we classify all the optimal fractional strong matching preclusion set of each.

Keywords

• Fractional perfect matching; Fractional matching preclusion; Fractional strong matching preclusion; Multiply twisted cube; Locally twisted cube