Abstract:Large carbon molecules, discovered at the end of the last century, are called fullerenes. The most famous of these, C 60 has the structure of the soccer ball: the seams represent chemical bonds and the points where three seams come together represent the carbon atoms. We use the term fullerene to represent all mathematically possible structures for the chemical fullerenes: trivalent plane graphs with only hexagonal and pentagonal faces. A simple consequence of Euler's formula is that each fullerene has exactly… Show more
“…We will present a mathematical formalisation which is based on the treatment of coronoids and benzenoids in the previous section of this paper. As we will see later, our definition of a fullerene patch is compatible with Graver's definition [12,13]. There is also a notion of a (m, k)-patch which received a lot of attention in the past years [2,3,11,18].…”
Section: Figure 18: a Patchmentioning
confidence: 58%
“…Let G be the subdivided cube in Figure 23. Let C 1 = (1, 2, 3, 4, 7, 6, 5), 1,5,9,10,14,8) and C 3 = (10, 11,12,13,16,15,14). Then (G; C 1 , C 2 , C 3 ) is an admissible structure.…”
Section: Altans Generalised Altans and Iterated Altansmentioning
confidence: 99%
“…In a previous paper we shifted attention from benzenoids to the more general subcubic planar graphs that we called patches, which generalise the fullerene patches of Graver et al [11,12,13,14,15,16]. In this paper, we similarly generalise coronoids to perforated patches, i.e., to patches with several disjoint holes.…”
In this paper we revisit coronoids, in particular multiple coronoids. We consider a mathematical formalisation of the theory of coronoid hydrocarbons that is solely based on incidence between hexagons of the infinite hexagonal grid in the plane. In parallel, we consider perforated patches, which generalise coronoids: in addition to hexagons, other polygons may also be present. Just as coronoids may be considered as benzenoids with holes, perforated patches are patches with holes. Both cases, coronoids and perforated patches, admit a generalisation of the altan operation that can be performed at several holes simultaneously. A formula for the number of Kekulé structures of a generalised altan can be derived easily if the number of Kekulé structures is known for the original graph. Pauling Bond Orders for generalised altans are also easy to derive from those of the original graph.
“…We will present a mathematical formalisation which is based on the treatment of coronoids and benzenoids in the previous section of this paper. As we will see later, our definition of a fullerene patch is compatible with Graver's definition [12,13]. There is also a notion of a (m, k)-patch which received a lot of attention in the past years [2,3,11,18].…”
Section: Figure 18: a Patchmentioning
confidence: 58%
“…Let G be the subdivided cube in Figure 23. Let C 1 = (1, 2, 3, 4, 7, 6, 5), 1,5,9,10,14,8) and C 3 = (10, 11,12,13,16,15,14). Then (G; C 1 , C 2 , C 3 ) is an admissible structure.…”
Section: Altans Generalised Altans and Iterated Altansmentioning
confidence: 99%
“…In a previous paper we shifted attention from benzenoids to the more general subcubic planar graphs that we called patches, which generalise the fullerene patches of Graver et al [11,12,13,14,15,16]. In this paper, we similarly generalise coronoids to perforated patches, i.e., to patches with several disjoint holes.…”
In this paper we revisit coronoids, in particular multiple coronoids. We consider a mathematical formalisation of the theory of coronoid hydrocarbons that is solely based on incidence between hexagons of the infinite hexagonal grid in the plane. In parallel, we consider perforated patches, which generalise coronoids: in addition to hexagons, other polygons may also be present. Just as coronoids may be considered as benzenoids with holes, perforated patches are patches with holes. Both cases, coronoids and perforated patches, admit a generalisation of the altan operation that can be performed at several holes simultaneously. A formula for the number of Kekulé structures of a generalised altan can be derived easily if the number of Kekulé structures is known for the original graph. Pauling Bond Orders for generalised altans are also easy to derive from those of the original graph.
“…In [7] it was shown that the similarity class of a linear patch with at most one pentagonal end is trivial. On the other hand, the similarity class of any linear patch with two pentagonal ends includes some additional nonlinear patches and is nontrivial, as is illustrated in 1.…”
Section: Linear Patchesmentioning
confidence: 99%
“…We will adopt the notation from [7] and let a patch be denoted as Π = (V, E, F, B) where V and E are the vertex and edge sets, F is the set of faces excluding the external face, and B is the boundary of the external face. One method of constructing a patch is to take a simple closed curve on a fullerene, and consider the subgraph created by deleting all vertices and edges on the "outside" of the curve.…”
In this paper, we show that fullerene patches with nice boundaries containing between 1 and 5 pentagons fall into several equivalence classes; furthermore, any two fullerene patches in the same class can be transformed into the same minimal configuration using combinatorial alterations.
Fullerenes are carbon molecules that form polyhedral cages. Their bond structures are exactly the planar cubic graphs that have only pentagon and hexagon faces. Strikingly, a number of chemical properties of a fullerene can be derived from its graph structure. A rich mathematics of cubic planar graphs and fullerene graphs has grown since they were studied by Goldberg, Coxeter, and others in the early 20th century, and many mathematical properties of fullerenes have found simple and beautiful solutions. Yet many interesting chemical and mathematical problems in the field remain open. In this paper, we present a general overview of recent topological and graph theoretical developments in fullerene research over the past two decades, describing both solved and open problems. WIREs Comput Mol Sci 2015, 5:96–145. doi: 10.1002/wcms.1207Conflict of interest: The authors have declared no conflicts of interest for this article.For further resources related to this article, please visit the WIREs website.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.