## On k-resonant fullerene graphs ∗ (801)

Citations: | 1 - 0 self |

### BibTeX

@MISC{Ye801onk-resonant,

author = {Dong Ye and Zhongbin Qi and Heping Zhang},

title = {On k-resonant fullerene graphs ∗},

year = {801}

}

### OpenURL

### Abstract

A fullerene graph F is a 3-connected plane cubic graph with exactly 12 pentagons and the remaining hexagons. Let M be a perfect matching of F. A cycle C of F is M-alternating if the edges of C appear alternately in and off M. A set H of disjoint hexagons of F is called a resonant pattern (or sextet pattern) if F has a perfect matching M such that all hexagons in H are M-alternating. A fullerene graph F is k-resonant if any i (0 ≤ i ≤ k) disjoint hexagons of F form a resonant pattern. In this paper, we prove that every hexagon of a fullerene graph is resonant and all leapfrog fullerene graphs are 2-resonant. Further, we show that a 3-resonant fullerene graph has at most 60 vertices and construct all nine 3-resonant fullerene graphs, which are also k-resonant for every integer k> 3. Finally, sextet polynomials of the 3-resonant fullerene graphs are computed.