Goedgebeur, JanMcKay, Brendan2016-06-140340-6253http://hdl.handle.net/1885/103296For 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 h<inf>d</inf> such that fullerenes with pentagons at least distance d apart and any number of hexagons greater than or equal to h<inf>d</inf> 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.20152024-03-03