Search arXivSearch

arXiv · 1703.05716

Sizes of Pentagonal Clusters in Fullerenes

Abstract

Stability and chemistry, both exohedral and endohedral, of fullerenes are critically dependent on the distribution of their obligatory 12 pentagonal faces. It is well known that there are infinitely many IPR-fullerenes and that the pentagons in these fullerenes can be at an arbitrarily large distance from each other. IPR-fullerenes can be described as fullerenes in which each connected cluster of pentagons has size 1. In this paper we study the combinations of cluster sizes that can occur in fullerenes and whether the clusters can be at an arbitrarily large distance from each other. For each possible partition of the number 12, we are able to decide whether the partition describes the sizes of pentagon clusters in a possible fullerene, and state whether the different clusters can be at an arbitrarily large distance from each other. We will prove that all partitions with largest cluster of size 5 or less can occur in an infinite number of fullerenes with the clusters at an arbitrarily large distance of each other, that 9 partitions occur in only a finite number of fullerene isomers and that 15 partitions do not occur at all in fullerenes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nino Bašić, Gunnar Brinkmann, Patrick W. Fowler, Tomaž Pisanski, Nico Van Cleemput. 2017-03-16. Sizes of Pentagonal Clusters in Fullerenes. https://doi.org/10.1007/s10910-017-0754-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO