On the anti-forcing number of fullerene graphs

Abstract

The anti-forcing number of a connected graph $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching. In this paper, we show that the anti-forcing number of every fullerene has at least four. We give a procedure to construct all fullerenes whose anti-forcing numbers achieve the lower bound four. Furthermore, we show that, for every even $n\ge 20$ ($n\ne 22,26$), there exists a fullerene with $n$ vertices that has the anti-forcing number four, and the fullerene with 26 vertices has the anti-forcing number five.

arXiv comment18 pages, 12 figures

Cited by in corpus (6)

• Tight upper bound on the maximum anti-forcing numbers of graphs
• Forcing and anti-forcing polynomials of perfect matchings of a pyrene system
• Forcing and anti-forcing polynomials of a polyomino graph
• The fullerenes with a perfect star packing
• Characterizing the fullerene graphs with the minimum forcing number 3
• On the anti-forcing number of graph powers