Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Fullerenes with distant pentagons

Thumbnail Image

Date

2015

Authors

Goedgebeur, Jan
McKay, Brendan

Journal Title

Journal ISSN

Volume Title

Publisher

University of Bayreuth

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 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.

Description

Keywords

Citation

URI

http://hdl.handle.net/1885/103296

Collections

ANU Research Publications

Source

MATCH - Communications in Mathematical and in Computer Chemistry

Type

Journal article

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

2037-12-31

Downloads

File
Description
01_Goedgebeur_Fullerenes_with_distant_2015.pdf (331.27 KB)

DSpace software copyright © 2002-2026 LYRASIS

abcd