Fullerenes with distant pentagons

Jan Goedgebeur, Brendan D. McKay

    Research output: Contribution to journalArticlepeer-review

    2 Citations (Scopus)


    For each d > 0, we find all the smallest fullerenes for which the least distance between two pentagons is d. We also show that for each d there is an hd such that fullerenes with pentagons at least distance d apart and any number of hexagons greater than or equal to hd exist. We also determine the number of fullerenes where the minimum distance between any two pentagons is at least d, for 1 ≤ d ≤ 5, up to 400 vertices.

    Original languageEnglish
    Pages (from-to)659-672
    Number of pages14
    Issue number3
    Publication statusPublished - 2015


    Dive into the research topics of 'Fullerenes with distant pentagons'. Together they form a unique fingerprint.

    Cite this