The generation of fullerenes

Gunnar Brinkmann, Jan Goedgebeur*, Brendan D. McKay

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    49 Citations (Scopus)

    Abstract

    We describe an efficient new algorithm for the generation of fullerenes. Our implementation of this algorithm is more than 3.5 times faster than the previously fastest generator for fullerenes - fullgen - and the first program since fullgen to be useful for more than 100 vertices. We also note a programming error in fullgen that caused problems for 136 or more vertices. We tabulate the numbers of fullerenes and IPR fullerenes up to 400 vertices. We also check up to 316 vertices a conjecture of Barnette that cubic planar graphs with maximum face size 6 are Hamiltonian and verify that the smallest counterexample to the spiral conjecture has 380 vertices.

    Original languageEnglish
    Pages (from-to)2910-2918
    Number of pages9
    JournalJournal of Chemical Information and Modeling
    Volume52
    Issue number11
    DOIs
    Publication statusPublished - 26 Nov 2012

    Fingerprint

    Dive into the research topics of 'The generation of fullerenes'. Together they form a unique fingerprint.

    Cite this