On the Anti-Forcing Number of Fullerene Graphs

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 20 (n6 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 ve.

[1]  D. Manolopoulos,et al.  An Atlas of Fullerenes , 1995 .

[2]  Nenad Trinajstić,et al.  On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids , 2008 .

[3]  Riste Škrekovski,et al.  Cyclic edge-cuts in fullerene graphs , 2008 .

[4]  Heping Zhang,et al.  New Lower Bound on the Number of Perfect Matchings in Fullerene Graphs , 2001 .

[5]  Dragan Marusic,et al.  On cyclic edge-connectivity of fullerenes , 2008, Discret. Appl. Math..

[6]  On the anti-Kekul´ e number and anti-forcing number of cata-condensed benzenoids , 2008 .

[7]  Heping Zhang,et al.  A note on the cyclical edge-connectivity of fullerene graphs , 2008 .

[8]  Tomislav Došlić,et al.  Cyclical Edge-Connectivity of Fullerene Graphs and (k, 6)-Cages , 2003 .

[9]  F. Harary,et al.  Graphical properties of polyhexes: Perfect matching vector and forcing , 1991 .

[10]  M. Randic,et al.  Innate degree of freedom of a graph , 1987 .

[11]  N. Trinajstic,et al.  On the Anti-forcing Number of Benzenoids , 2007 .

[12]  Branko Grünbaum,et al.  The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra , 1963, Canadian Journal of Mathematics.

[13]  D. Klein,et al.  Forcing, Freedom, & Uniqueness in Graph Theory & Chemistry , 2014 .

[14]  Heping Zhang,et al.  Forcing matching numbers of fullerene graphs , 2010, Discret. Appl. Math..

[15]  Xueliang Li.  Hexagonal Systems with Forcing Single Edges , 1997, Discret. Appl. Math..

[16]  Riste Škrekovski,et al.  Cyclic 7-edge-cuts in fullerene graphs , 2008 .