Title of article
Closed formulas for the number of small paths, independent sets and matchings in fullerenes
Author/Authors
BEHMARAM، A نويسنده , , A. and Yousefi-Azari، نويسنده , , H. and Ashrafi، نويسنده , , A.R.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
4
From page
1721
To page
1724
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 k and k -matchings in fullerenes, when k = 1 , 2 , 3 , 4 .
Keywords
Matching , Independent set , Fullerene
Journal title
Applied Mathematics Letters
Serial Year
2012
Journal title
Applied Mathematics Letters
Record number
1528532
Link To Document