| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1708356 | Applied Mathematics Letters | 2012 | 4 Pages |
Abstract
Fullerene graphs are 3-regular planar graphs whose faces are pentagons or hexagons. In this paper, we first compute the number of paths of low order in a fullerene. Then apply these numbers to obtain the number of independent sets of size kk and kk-matchings in fullerenes, when k=1,2,3,4k=1,2,3,4.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
A. Behmaram, H. Yousefi-Azari, A.R. Ashrafi,