C₆₀的完美匹配与Hamilton圈  

Perfect Matchings and Hamiltonian Cycles of C60

作　　者：马聪聪 王倩倩 姚海元 

机构地区：[1]西北师范大学数学与统计学院,甘肃 兰州

出　　处：《理论数学》2020年第8期745-763,共19页Pure Mathematics

摘　　要：设G是一个3-正则的连通图。删掉G一个Hamilton圈(删边不删点)后剩下的子图是G的一个完美匹配;反之,删掉G一个完美匹配后剩下的子图只要是连通的,那一定是原图的Hamilton圈。因此本文通过删除完美匹配的方法给出了Buckminsterfullerene (C60)的所有Hamilton圈,进而通过Hamilton圈研究了完美匹配之间的关系。Let G be a 3-regular connected graph. If we delete a Hamiltonian cycle of G (delete edges but not vertices), then the rest graph is a perfect matching of G. On the contrary, the rest subgraph deleting a perfect matching of G must be Hamiltonian cycle of G provided that it is connected. Consequently, all Hamiltonian cycles of C60 are given in this paper by the way of deleting perfect matchings. And then it is shown that the relationship of perfect matchings is obtained by Hamiltonian cycles.

关 键 词：完美匹配 C₆₀ HAMILTON圈 

分 类 号：O15[理学—数学]