# Fractional matching preclusion for restricted hypercube-like graphs

## TL;DR

This paper investigates fractional matching preclusion numbers in restricted hypercube-like graphs, extending known results and providing insights into their robustness as interconnection networks for parallel systems.

## Contribution

It introduces the fractional matching preclusion concepts for restricted hypercube-like graphs and determines their preclusion numbers, extending previous results in the field.

## Key findings

- Calculated fractional matching preclusion numbers for restricted hypercube-like graphs.
- Extended known results on matching preclusion to fractional variants.
- Provided theoretical bounds and exact values for these graphs.

## Abstract

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.