2-Resonant fullerenes
Combinatorics
2012-11-27 v1
Abstract
A fullerene graph is a planar cubic graph with exactly 12 pentagonal faces and other hexagonal faces. A set of disjoint hexagons of is called a resonant pattern (or sextet pattern) if has a perfect matching such that every hexagon in is -alternating. is said to be -resonant if any () disjoint hexagons of 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 or 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