Enumeration of the Component Number of Links Corresponding to the Periodic Double-triangular Lattices with Two Spiderweb Graphs
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.
enumerationplane graphperiodic double-triangular lattices with two spiderweb graphsgraph-ic changecomponent number of link
NETL
NSTL
万方数据
