English

2-Resonant fullerenes

Combinatorics 2012-11-27 v1

Abstract

A fullerene graph FF is a planar cubic graph with exactly 12 pentagonal faces and other hexagonal faces. A set H\mathcal{H} of disjoint hexagons of FF is called a resonant pattern (or sextet pattern) if FF has a perfect matching MM such that every hexagon in H\mathcal{H} is MM-alternating. FF is said to be kk-resonant if any ii (0ik0\leq i\leq k) disjoint hexagons of FF form a resonant pattern. It was known that each fullerene graph is 1-resonant and all 3-resonant fullerenes are only the nine graphs. In this paper, we show that the fullerene graphs which do not contain the subgraph LL or RR as illustrated in Fig. 1 are 2-resonant except for the specific eleven graphs. This result implies that each IPR fullerene is 2-resonant.

Cite

@article{arxiv.1211.5640,
  title  = {2-Resonant fullerenes},
  author = {Rui Yang and Heping Zhang},
  journal= {arXiv preprint arXiv:1211.5640},
  year   = {2012}
}

Comments

34 pages, 25 figures

R2 v1 2026-06-21T22:43:27.597Z