Computing the bipartite edge frustration of fullerene graphs
Discrete Applied Mathematics
European Journal of Combinatorics
| Hi-index | 0.04 |
Let G be a graph with a perfect matching. The anti-Kekule number is the smallest number of edges of G whose removal will result in a connected subgraph with no perfect matching. In this note, we show that, if G is a cyclically (r+1)-edge-connected r-regular graph (r=3) of even order, then either the anti-Kekule number of G is at least r+1, or G is not bipartite, and the smallest odd cycle transversal of G has at most r edges. For cubic graphs, the bound of the anti-Kekule number is optimal. Our result generalizes previous results on anti-Kekule numbers of fullerenes obtained by Kutnar et al. [K. Kutnar, J. Sedlar, D. Vukicevic, On the anti-Kekule number of leapfrog fullerenes, J. Math. Chem. 45 (2009) 431-441.] and Yang et al. [Q. Yang, D. Ye, H. Zhang, Y. Lin, On the anti-Kekule number of fullerenes, MATCH Commun. Math. Comput. Chem. 67 (2) (2012) 281-288].