On the spectrum of the forced matching number of graphs

Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian

Let $G$ be a graph that admits a perfect matching. A {\sf forcing set} for a perfect matching $M$ of $G$ is a subset $S$ of $M$, such that $S$ is contained in no other perfect matc…