On the Volume of µ-Way S(K1,3)-Trade on (3, 6)-Fullerene Graphs
A perfect star packing in a fullerene graph is a spanning subgraph whose every component is isomorphic to the star graph K1,3. A perfect star packing in a (3, 6)-fullerene graph is called a perfect star packing of type T0 if no center of a star is on a triangle of G. A µ-way G-trade consists of µ disjoint decomposition of graph H into copies of graph G. In this paper, we use the concept of packing and specify values of the number of copies of G=S(K1,3) for which there exists a µ-way S(K1,3)-trade when the underlying graph is a non-trivial (3, 6)-fullerene graph.
Authors
- Gholam Hossein Fath-Tabar (ORCID: https://orcid.org/0000-0003-1105-3020)
- Meysam Taheri-Dehkordi (ORCID: https://orcid.org/0000-0002-6085-2622)
Publication Details
- Journal
- match Communications in Mathematical and in Computer Chemistry
- Published
- 2025-01-01
- DOI
- https://doi.org/10.46793/match.94-2.407t
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00