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 [17] recently introduced the concept of fractional matching preclusion number. The fractional matching preclusion number (FMP number) of G, denoted by f mp(G), is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The fractional strong

more »

... atching preclusion number (FSMP number) of G, denoted by f smp(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.