Skip navigation
Skip navigation

Fullerenes with distant pentagons

Goedgebeur, Jan; McKay, Brendan


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.

CollectionsANU Research Publications
Date published: 2015
Type: Journal article
Source: MATCH - Communications in Mathematical and in Computer Chemistry


File Description SizeFormat Image
01_Goedgebeur_Fullerenes_with_distant_2015.pdf331.27 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator