Maximizing the Minimum and Maximum Forcing Numbers of Perfect Matchings of Graphs

Qian qian Liu, He ping Zhang

Let $G$ be a simple graph with $2n$ vertices and a perfect matching. The forcing number $f(G,M)$ of a perfect matching $M$ of $G$ is the smallest cardinality of a subset of $M$ tha…