Abstract
AbstractA 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 vertices have at least Hamilton cycles.
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call