Abstract:In this paper we consider fullerene patches with nice boundaries containing between one and five pentagonal faces. We find necessary conditions for the side lengths of such patches, and then prove these conditions are sufficient by constructing such patches.
“…Next it will be useful to introduce some definitions utilized in [4,5,[14][15][16]. The boundary code of a patch is described by a sequence of 2's and 3's corresponding to the degree of the vertices on the boundary of the patch in cyclic order.…”
The saturation number of a graph is the cardinality of a smallest maximal matching. This paper presents bounds for the saturation number of carbon nanocones which are asymptotically equal. The same techniques are applied for the saturation number of certain families of carbon nanotubes, which improve previous results and in one case, yields the exact value.
“…Next it will be useful to introduce some definitions utilized in [4,5,[14][15][16]. The boundary code of a patch is described by a sequence of 2's and 3's corresponding to the degree of the vertices on the boundary of the patch in cyclic order.…”
The saturation number of a graph is the cardinality of a smallest maximal matching. This paper presents bounds for the saturation number of carbon nanocones which are asymptotically equal. The same techniques are applied for the saturation number of certain families of carbon nanotubes, which improve previous results and in one case, yields the exact value.
“…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 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.
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.