Star and Semi-Star Transformations in Fullerene Graphs

2022/11/18 by Meysam Taheri-Dehkordi, Taheri-Dehkordi, Meysam
Chemistry · Materials Science · Mathematics · #05c10 #05c92 #Combinatorics (math.CO) #FOS: Mathematics #Fullerene Chemistry and Applications #Graph theory and applications #Graphene research and applications

paper · pdf · doi:10.48550/arxiv.2211.15471

openalex publication_date 2022/11/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A perfect star packing in a graph G is a spanning subgraph of G whose every component is isomorphic to the star graph K_1,3. A perfect star packing of a fullerene graph G is of type P0 if all the centers of stars lie on hexagons of G. Many fullerene graphs arise from smaller fullerene graphs by applying some transformations. In this paper, we introduce two transformations for fullerene graphs that have perfect star packing of type P0 and examine some characteristics of the graphs obtained from this transformation.

Related

• The fullerenes with a perfect star packing
• Asymptotic enumeration of perfect matchings in m-barrel fullerene graphs
• Parameterizing Fullerenes with Vertex Combinations
• Some open mathematical problems on fullerenes
• Sandwiching saturation number of fullerene graphs