  The restricted hypercube-like graphs, variants of the hypercube, were
proposed as desired interconnection networks of parallel systems. The matching
preclusion number of a graph is the minimum number of edges whose deletion
results in the graph with neither perfect matchings nor almost perfect
matchings. The fractional perfect matching preclusion and fractional strong
perfect matching preclusion are generalizations of the concept matching
preclusion. In this paper, we obtain fractional matching preclusion number and
fractional strong matching preclusion numbers of restricted hypercube-like
graphs, which extend some known results.
