Fullerene graphs with exponentially many perfect matchings

被引：25
|
作者：
Doslic, Tomislav [1 ]
机构：
[1] Univ Zagreb, Fac Agr, Dept Math & Informat, Zagreb 10000, Croatia
来源：
JOURNAL OF MATHEMATICAL CHEMISTRY | 2007年 / 41卷 / 02期
关键词：
enumeration; fullerene graph; icosahedral fullerene; perfect matching;
D O I：
10.1007/s10910-006-9068-y
中图分类号：
O6 [化学];
学科分类号：
0703 ;
摘要：
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.
引用
收藏
页码：183 / 192
页数：10
相关论文
共 50 条
  • [1] Fullerene Graphs with Exponentially Many Perfect Matchings
    Tomislav Došlić
    [J]. Journal of Mathematical Chemistry, 2007, 41 : 183 - 192
  • [2] Fullerene graphs have exponentially many perfect matchings
    Kardos, Frantisek
    Kral, Daniel
    Miskuf, Jozef
    Sereni, Jean-Sebastien
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 2009, 46 (02) : 443 - 447
  • [3] Fullerene graphs have exponentially many perfect matchings
    František Kardoš
    Daniel Král’
    Jozef Miškuf
    Jean-Sébastien Sereni
    [J]. Journal of Mathematical Chemistry, 2009, 46 : 443 - 447
  • [4] Exponentially many perfect matchings in cubic graphs
    Esperet, Louis
    Kardos, Frantisek
    King, Andrew D.
    Kral, Daniel
    Norine, Serguei
    [J]. ADVANCES IN MATHEMATICS, 2011, 227 (04) : 1646 - 1664
  • [5] On lower bounds of number of perfect matchings in fullerene graphs
    Tomislav Došlić
    [J]. Journal of Mathematical Chemistry, 1998, 24 : 359 - 364
  • [6] On lower bounds of number of perfect matchings in fullerene graphs
    Doslic, T
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 1998, 24 (04) : 359 - 364
  • [7] New Lower Bound on the Number of Perfect Matchings in Fullerene Graphs
    Heping Zhang
    Fuji Zhang
    [J]. Journal of Mathematical Chemistry, 2001, 30 : 343 - 347
  • [8] New lower bound on the number of perfect matchings in fullerene graphs
    Zhang, HP
    Zhang, FJ
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 2001, 30 (03) : 343 - 347
  • [9] Asymptotic enumeration of perfect matchings in m-barrel fullerene graphs
    Behmaram, Afshin
    Boutillier, Cedric
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 266 : 153 - 162
  • [10] Perfect matchings of cellular graphs
    Ciucu, M
    [J]. JOURNAL OF ALGEBRAIC COMBINATORICS, 1996, 5 (02) : 87 - 103
12345