Fast Generation of Fullerenes
Presented by Mr. Jan GOEDGEBEUR
Type: Oral presentation
We describe a new algorithm for the efficient generation of fullerenes. The algorithm generates all non-isomorphic fullerenes using the construction operations from . We will describe the construction, provide details on the way isomorphism rejection is handled, and give some optimizations. Our implementation of this algorithm is more than 3 times faster than previous generators for fullerenes. Using this new generator we were able to enumerate all fullerenes up to 400 vertices. This also allowed us to determine the smallest fullerene that does not allow a face spiral code: it has 380 vertices (see ).  M. Hasheminezhad, H. Fleischner, and B.D. McKay. A universal set of growth operations for fullerenes. Chem. Phys. Lett., 464:118--121, 2008.  G. Brinkmann, J. Goedgebeur, and B.D. McKay. The smallest fullerene without a spiral. Chem. Phys. Lett., 522:54--55, 2012.
Location: Portorož, Slovenia
Address: University of Primorska, Faculty of Tourism Studies, Obala 11a, SI-6320 Portorož - Portorose, Slovenia