双蛛网周期双重三角格图链环分支数的计数  

Enumeration of the Component Number of Links Corresponding to the Periodic Double-triangular Lattices with Two Spiderweb Graphs

作　　者：林跃峰[1] LIN Yuefeng(Zhangzhou City Vocational College,Zhangzhou 363000,China)

机构地区：[1]漳州城市职业学院,福建漳州363000

出　　处：《安阳师范学院学报》2024年第5期1-6,共6页Journal of Anyang Normal University

摘　　要：通过对平图实施不改变其链环分支数的无符号平图的三类Reidemeister变换,以及对平图实施粘合同一个面上不相邻的两个顶点的图变换,化大图为小图,从而获得双蛛网周期双重三角格图链环分支数的计数。In this paper,we perform three kinds of unsigned graphic Reidemeister moves without changing the component number of corresponding links on plane graphs,and perform the graphic move of contracting two non-adjacent vertices on one face,to change large graphs into smaller ones.As a result,we obtain the component number of links corresponding to the periodic double-triangular lattices with two spiderweb graphs.

关 键 词：计数 平图 双蛛网周期双重三角格图 图变换 链环分支数 

分 类 号：O157.5[理学—数学]