Mathematical aspects of fullerenes

被引:36
作者
Andova, Vesna [1 ]
Kardos, Frantisek [2 ]
Skrekovski, Riste [3 ,4 ,5 ]
机构
[1] Ss Cyril & Methodius Univ, Fac Elect Engn & Informat Technol, Ruger Boskovik 18, Skopje 1000, North Macedonia
[2] Univ Bordeaux, LaBRI, 351 Cours Liberat, F-33405 Talence, France
[3] Univ Ljubljana, Fac Math & Phys, Jadranska 21, Ljubljana 1000, Slovenia
[4] Fac Informat Studies, Novo Mesto 8000, Slovenia
[5] Nat Sci & Informat Technol, Fac Math, Koper 6000, Slovenia
关键词
Fullerene; cubic graph; planar graph; topological indices; CYCLICAL EDGE-CONNECTIVITY; PERFECT MATCHINGS; CONSTRUCTIVE ENUMERATION; SATURATION NUMBER; INDEPENDENT SETS; LONG CYCLES; GRAPHS; GENERATION; INDEXES; WIENER;
D O I
10.26493/1855-3974.834.b02
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Fullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentagonal faces, while all other faces are hexagons. Fullerene graphs are mathematical models of fullerene molecules, i.e., molecules comprised only by carbon atoms different than graphites and diamonds. We give a survey on fullerene graphs from our perspective, which could be also considered as an introduction to this topic. Different types of fullerene graphs are considered, their symmetries, and construction methods. We give an overview of some graph invariants that can possibly correlate with the fullerene molecule stability, such as: the bipartite edge frustration, the independence number, the saturation number, the number of perfect matchings, etc.
引用
收藏
页码:353 / 379
页数:27
相关论文
共 96 条
  • [41] Finding more perfect matchings in leapfrog fullerenes
    Doslic, Tomislav
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 2009, 45 (04) : 1130 - 1136
  • [42] Bipartizing fullerenes
    Dvorak, Zdenek
    Lidicky, Bernard
    Skrekovski, Riste
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (06) : 1286 - 1293
  • [43] FORMATION OF CARBON NANOFIBERS
    ENDO, M
    KROTO, HW
    [J]. JOURNAL OF PHYSICAL CHEMISTRY, 1992, 96 (17) : 6941 - 6944
  • [44] Long cycles in fullerene graphs
    Erman, Rok
    Kardos, Frantisek
    Miskuf, Jozef
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 2009, 46 (04) : 1103 - 1111
  • [45] SHORTNESS EXPONENTS OF FAMILIES OF GRAPHS
    EWALD, G
    [J]. ISRAEL JOURNAL OF MATHEMATICS, 1973, 16 (01) : 53 - 61
  • [46] Graph-theoretic independence as a predictor of fullerene stability
    Fajtlowicz, S
    Larson, CE
    [J]. CHEMICAL PHYSICS LETTERS, 2003, 377 (5-6) : 485 - 490
  • [47] ODD CYCLE TRANSVERSALS AND INDEPENDENT SETS IN FULLERENE GRAPHS
    Faria, Luerbio
    Klein, Sulamita
    Stehlik, Matej
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (03) : 1458 - 1469
  • [48] Independence number and fullerene stability
    Fowler, P. W.
    Daugherty, S.
    Myrvold, W.
    [J]. CHEMICAL PHYSICS LETTERS, 2007, 448 (1-3) : 75 - 82
  • [49] SYMMETRY ASPECTS OF BONDING IN CARBON CLUSTERS - THE LEAPFROG TRANSFORMATION
    FOWLER, PW
    REDMOND, DB
    [J]. THEORETICA CHIMICA ACTA, 1992, 83 (5-6): : 367 - 375
  • [50] POSSIBLE SYMMETRIES OF FULLERENE STRUCTURES
    FOWLER, PW
    MANOLOPOULOS, DE
    REDMOND, DB
    RYAN, RP
    [J]. CHEMICAL PHYSICS LETTERS, 1993, 202 (05) : 371 - 378