Fractional matching preclusion number of graphs

Abstract

The fractional matching preclusion number of a graph G, denoted by fmp(G), is the minimum number of edges whose deletion results in a graph that has no fractional perfect matchings. In this paper, we first give some sharp upper and lower bounds of fractional matching preclusion number. Next, graphs with large and small fractional matching preclusion number are characterized, respectively. In the end, we investigate some extremal problems on fractional matching preclusion number.