Results 1 
1 of
1
On kresonant fullerene graphs ∗
, 801
"... A fullerene graph F is a 3connected 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 Malternating 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 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A fullerene graph F is a 3connected 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 Malternating 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 Malternating. A fullerene graph F is kresonant 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 2resonant. Further, we show that a 3resonant fullerene graph has at most 60 vertices and construct all nine 3resonant fullerene graphs, which are also kresonant for every integer k> 3. Finally, sextet polynomials of the 3resonant fullerene graphs are computed.