perfect star packings in one type of (2, 6)-fullerene graphs

A (2,6)-fullerene graph is a 2-connected, 3-regular and planar graph that only has faces with lengths of two or six. the number of faces of length two in these graphs is equal to three, according to euler s formula. a perfect star packing in a graph g is a spanning subgraph of ???? in which each component of it is isomorphic to the star graph ????1,3. in this presentation, we investigate the existence of perfect star packings in a specific type of (2,6)-fullerene graph.