The uniqueness of perfect star packings and the existence of pseudo-matchings in (2,6)-fullerene graphs
Abstract
A perfect star packing can be described as a spanning subgraph whose connected components are isomorphic to the star graph K 1,3 . A perfect pseudo-matching is a spanning subgraph in which every component is isomorphic to either K 2 or K 1,3 . The study of packing problems on fullerene graphs is of particular interest due to their potential relevance in describing local bonding arrangements in carbon nanostructures. In this paper, we study the uniqueness of perfect star packing, and the existence of pseudo-matchings in (2, 6)- fullerene graphs. Moreover, we show that the perfect star packing in these graphs is unique. Furthermore, we introduced some perfect pseudo-matchings in (2, 6)-fullerene graphs.
Fields of Study & Subjects
Graph theory and applications
Advanced Graph Theory Research
Advanced Combinatorial Mathematics
Publication details
- Journal / source
- Nanosystems Physics Chemistry Mathematics
- Volume
- 17
- Issue
- 1
- Pages
- 17–25
- Publication date
- 4 March 2026
- Language
- EN