双蛛网周期双重三角格图链环分支数的计数
Enumeration of the Component Number of Links Corresponding to the Periodic Double-triangular Lattices with Two Spiderweb Graphs
林跃峰1
作者信息
- 1. 漳州城市职业学院,福建 漳州 363000
- 折叠
摘要
通过对平图实施不改变其链环分支数的无符号平图的三类Reidemeister变换,以及对平图实施粘合同一个面上不相邻的两个顶点的图变换,化大图为小图,从而获得双蛛网周期双重三角格图链环分支数的计数.
Abstract
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 com-ponent number of links corresponding to the periodic double-triangular lattices with two spiderweb graphs.
关键词
计数/平图/双蛛网周期双重三角格图/图变换/链环分支数Key words
enumeration/plane graph/periodic double-triangular lattices with two spiderweb graphs/graph-ic change/component number of link引用本文复制引用
出版年
2024
NETL
NSTL
万方数据