Pith. sign in

REVIEW

2-Resonant fullerenes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1211.5640 v1 pith:XZATSUPT submitted 2012-11-24 math.CO

classification math.CO
keywords resonantfullerenegraphgraphspatterndisjointfacesfullerenes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

A fullerene graph $F$ is a planar cubic graph with exactly 12 pentagonal faces and other hexagonal faces. 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 every hexagon in $\mathcal{H}$ is $M$-alternating. $F$ is said to be $k$-resonant if any $i$ ($0\leq i\leq k$) disjoint hexagons of $F$ 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 $L$ or $R$ as illustrated in Fig. 1 are 2-resonant except for the specific eleven graphs. This result implies that each IPR fullerene is 2-resonant.

Discussion (0). Continue with ORCID to comment.

Pith tools