Fullerene Graphs with Exponentially Many Perfect Matchings |
| |
| Authors: | Tomislav Došlić |
| |
| Institution: | (1) Department of Informatics and Mathematics, Faculty of Agriculture, University of Zagreb, Svetošimunska c. 25, 10000 Zagreb, Croatia |
| |
| Abstract: | We show that for all sufficiently large even p there is a fullerene graph on p vertices 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 exponentially many perfect matchings and indicate how such results could be extended
to the fullerenes with lower symmetry. |
| |
| Keywords: | enumeration fullerene graph icosahedral fullerene perfect matching |
| 本文献已被 SpringerLink 等数据库收录！ |
|
