Tight upper bound on the maximum anti-forcing numbers of graphs

Lingjuan Shi, Heping Zhang

Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number. In this paper, we get a…