中文摘要：

设G是一个有完美匹配的图。若G的边集s满足G—s有唯一完美匹配，则称s为反强迫集。包含边数最少的反强迫集叫做极小反强迫集，其中边的数日叫做图G的反强迫数。本文主要解决硼氮富勒烯图（恰好有六个四边形面，其它面都是六边形，3一连通的平面二部图）的反强迫数。我们得到一类管状，环边连通度为3的硼氮富勒烯图的反强迫数，然后得到任何硼氮富勒烯图的反强迫数至少为3，进而构造出所有反强迫数为3的硼氮富勒烯图，共有两个。

英文摘要：

Let G be a graph that admits a perfect matching M. A anti - forcing set of G is the edge set S such that G - S has a unique perfect matching. The anti - forcing set of the smallest cardinality is called the minimal anti - forcing set, and its car- dlnality is the anti- forcing number of G. In this paper, we consider boron- nitrogen （BN） fuUerene graphs, cubic 3 -con- nected phne bipartite graphs with exactly six square faces and other hexagonal faces. We obtain that the anti - forcing number of tubular BN - fullerene grhphs with cyclic edge - connectivity 3. Then we show that the anti - forcing number of any BN - fLdlerene graphs is at least three. Furthermore, we mainly construct all two BN - fullerene graphs with the anti - forcing num- ber three.