Back to Search
Start Over
2-resonant fullerenes.
- Source :
-
European Journal of Combinatorics . Oct2015, Vol. 49, p13-24. 12p. - Publication Year :
- 2015
-
Abstract
- A fullerene graph F is a planar cubic graph with exactly 12 pentagonal faces and other hexagonal faces. 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 every hexagon in H is M -alternating. F is said to be k - resonant if any i ( 0 ≤ i ≤ k ) disjoint hexagons of F form a resonant pattern. It was known that each fullerene graph is 1-resonant and there are only nine fullerene graphs that are 3-resonant. 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 49
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 102879393
- Full Text :
- https://doi.org/10.1016/j.ejc.2015.02.025