چكيده فارسي :
A fullerene graph is a 3 regular planar simple finite graph with pentagon or hexagon faces. In these
graphs the number of pentagon faces is 12. Therefore, any fullerene graph can be characterized by
number of its hexagon faces. In this note, for any h> 1, we will construct a fullerene graph with h
hexagon faces. Then, using the leapfrogging process we will construct stablefullerenes with20+3h
hexagon faces, for any h> 1
