On the Number of Perfect Star Packing and Perfect Pseudo Matching in Some Fullerene Graphs
نویسندگان
1 Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan 87317-53153, I. R. Iran
2 University of Applied Science and Technology (UAST), Tehran, IRAN
doi
10.22052/ijmc.2022.248451.1669چکیده
A perfect star packing in a fullerene graph G is a spanning subgraph of G whose every component is isomorphic to the star graph K_1,3. A perfect pseudo matching of a fullerene graph G is a spanning subgraph H of G such that each component of H is either K_2 or K_1,3. In this paper, we examine the number of perfect star packing in (3,6)-fullerene graphs and perfect pseudo matching in chamfered fullerene graphs.
