engleski

Fullerene graphs with exponentially many perfect matchings

We show that for all suffi ciently large even p there is a fullerene graph on p verti- ces that has exponentially many perfect matchings in terms of the number of vertices. Further, we show that all fullerenes with full icosahedral symmetry group have expo- nentially many perfect matchings and indicate how such results could be extended to the fullerenes with lower symmetry.

enumeration; fullerene graph; icosahedral fullerene; perfect matching

nije evidentirano