Fractional strong matching preclusion for two variants of hypercubes

Authors

Huifen Ge, School of Computer, Qinghai Normal UniversityFollow
Tianlong Ma, Department of Basic Research, Qinghai UniversityFollow
Miaolin Wu, School of Mathematics and Statistics, Qinghai Normal UniversityFollow
Yuzhi Xiao, School of Computer, Qinghai Normal UniversityFollow

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.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Recommended Citation

Ge, Huifen; Ma, Tianlong; Wu, Miaolin; and Xiao, Yuzhi (2019) "Fractional strong matching preclusion for two variants of hypercubes," Theory and Applications of Graphs: Vol. 6: Iss. 2, Article 2.
DOI: 10.20429/tag.2019.060202
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol6/iss2/2