Abstract
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 language | English |
---|---|
Pages (from-to) | 659-672 |
Number of pages | 14 |
Journal | Match |
Volume | 74 |
Issue number | 3 |
Publication status | Published - 2015 |