Title of article
On the Number of Perfect Star Packing and Perfect Pseudo-Matching in Some Fullerene Graphs
Author/Authors
Taheri-Dehkordi ، Meysam University of Applied Science and Technology (UAST) , Fath-Tabar ، Gholam Hossein Department of Pure Mathematics - Faculty of Mathematical Sciences - University of Kashan
From page
7
To page
18
Abstract
A perfect star packing in a fullerene graph G is a spanning subgraph of G whose every component is isomorphic to the star graph K1,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 K2 or K1,3. In this paper, we calculate the number of perfect star packing in some (3, 6)-fullerene graphs and perfect pseudo-matching in Chamfered fullerene graphs.
Keywords
Fullerene graphs , Perfect star packing , Perfect , pseudo , matching
Journal title
Iranian Journal of Mathematical Chemistry
Journal title
Iranian Journal of Mathematical Chemistry
Record number
2742032
Link To Document