Fullerene graphs of small diameter - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue MATCH Communications in Mathematical and in Computer Chemistry Année : 2017

Fullerene graphs of small diameter

Résumé

A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of Andova and Skrekovski [MATCH Commun. Math. Comput. Chem. 70 (2013) 205-220], who conjectured that every fullerene graph on $n$ vertices has diameter at least $\lfloor \sqrt{5n/3}\rfloor-1$.

Dates et versions

hal-01683804 , version 1 (14-01-2018)

Identifiants

Citer

Diego Nicodemos, Matej Stehlik. Fullerene graphs of small diameter. MATCH Communications in Mathematical and in Computer Chemistry, 2017, 77, pp.725-728. ⟨hal-01683804⟩
159 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More