Abstract
We establish an exact method for drawing fullerene patches in the hexagonal tessellation of the plane. Using these embeddings, we then provide a closed form equation for the total number of symmetric and near-symmetric fullerene patches, up to isomorphism. The function depends only on parameters of the boundary code.
Similar content being viewed by others
References
P. Bonsma, F. Breuer, Finding fullerene patches in polynomial time. in ISAAC 2009, vol 5878, LNCS, pp. 750–759 (2009)
G. Brinkmann, A.W.M. Dress, PentHex puzzles: A reliable and efficient top-down approach to fullerene-structure enumeration. Adv. Appl. Math. 21, 473–480 (1998)
G. Brinkmann, N. Van Cleemput, Classification and generation of nanocones. Discrete Appl. Math. 159, 1528–1539 (2011)
M. Deza, P.W. Fowler, V. Grishukin, Allowed boundary sequences for fused polycyclic patches and related algorithmic problems. J. Chem. Inf. Comput. Sci. 41, 300–308 (2011)
C. Graves, J. McLoud-Mann, Side lengths of pseudoconvex fullerene patches. Ars Math. Contemp. 5, 291–302 (2012)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Graves, C., Graves, S.J. Counting symmetric and near-symmetric fullerene patches. J Math Chem 52, 2423–2441 (2014). https://doi.org/10.1007/s10910-014-0393-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10910-014-0393-2