PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

On decompositions of leapfrog fullerenes
Dragan Marušič, Klavdija Kutnar and Damir Vukičević
J. math. chem. Volume 45, Number 2, pp. 406-416, 2009. ISSN 0259-9791


It is shown that given a fullerene F with the number of vertices n divisible by 4, and such that no two pentagons in F share an edge, the corresponding leapfrog fullerene Le(F) contains a long cycle of length 3n − 6 missing out only one hexagon.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8229
Deposited By:Boris Horvat
Deposited On:21 February 2012