Graphs with large maximum forcing number

Qianqian Liu, Ajit A. Diwan, Heping Zhang

For a graph $G$ with order $2n$ and a perfect matching, let $f(G)$ and $F(G)$ denote the minimum and maximum forcing number of $G$ respectively. Then $0\le f(G)\le F(G)\le n-1$.…