A fullerene graph is a 3‐connected cubic planar graph with pentagonal and hexagonal faces. The leapfrog transformation of a planar graph produces the dual of the truncation of the given graph. A fullerene graph is a leapfrog if it can be obtained from another fullerene graph by the leapfrog transformation. We prove that leapfrog fullerene graphs on $n=12k-6$ vertices have at least $2^k$ Hamilton cycles.

中文翻译：

---

至少有一半的越过富勒烯图具有成倍的汉密尔顿周期

富勒烯图是具有五边形和六边形面的3连通立方平面图。平面图的跨越式转换产生给定图的截断的对偶。如果富勒烯图可以通过跨跃变换从另一个富勒烯图获得，则该富勒烯图为跨跃。我们证明在$ñ=12ķ-6$ 顶点至少具有 ${\mathrm{2个}}^{ķ}$ 汉密尔顿循环。