On k-resonant fullerene graphs

Details On k-resonant fullerene graphs On k-resonant fullerene graphs

2008-01-09

arxiv.org/abs/0801.1483v2

SIAM J. DISCRETE MATH. Vol. 23 (2009) pp. 1023

Mathematics

Combinatorics

26 pages; 29 figures

Scientific paper

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 $\mathcal 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 $\mathcal H$ are $M$-alternating. A fullerene graph $F$ is $k$-resonant if any $i$ ($0\leq i \leq 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.

Affiliated with

Also associated with

No associations

Rating

On k-resonant fullerene graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On k-resonant fullerene graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On k-resonant fullerene graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-670730