Fractional matching preclusion for butterfly derived networks

Authors

Xia WangFollow
Tianlong Ma, Qinghai UniversityFollow
Chengfu YeFollow
Yuzhi XiaoFollow
Fang WangFollow

Abstract

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 [18] recently introduced the concept of fractional matching preclusion number. The fractional matching preclusion number (FMP number) of G, denoted by fmp(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, denoted by fsmp(G), is the minimum number of vertices and edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we study the fractional matching preclusion number and the fractional strong matching preclusion number for butterfly network, augmented butterfly network and enhanced butterfly network.

Creative Commons License

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

Recommended Citation

Wang, Xia; Ma, Tianlong; Ye, Chengfu; Xiao, Yuzhi; and Wang, Fang (2019) "Fractional matching preclusion for butterfly derived networks," Theory and Applications of Graphs: Vol. 6: Iss. 1, Article 3.
DOI: 10.20429/tag.2019.060103
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol6/iss1/3