数学研究
數學研究
수학연구
JOURNAL OF MATHEMATICAL STUDY
2011年
3期
257-269
,共13页
计数%左右路%格子图%闭曲面%环面链环
計數%左右路%格子圖%閉麯麵%環麵鏈環
계수%좌우로%격자도%폐곡면%배면련배
Enumeration%Left-right paths%Lattices%Closed surfaces%Torus link
设G是连通的胞腔嵌入于某闭曲面的图，G的一条左右路是指沿G的边通过交错的选择最左和最右的边作为下一条边走出的一闭途径．本文计数得到了自然嵌入到环面，Klein瓶和射影平面的方格子和三角格子图的左右路数．
設G是連通的胞腔嵌入于某閉麯麵的圖，G的一條左右路是指沿G的邊通過交錯的選擇最左和最右的邊作為下一條邊走齣的一閉途徑．本文計數得到瞭自然嵌入到環麵，Klein瓶和射影平麵的方格子和三角格子圖的左右路數．
설G시련통적포강감입우모폐곡면적도，G적일조좌우로시지연G적변통과교착적선택최좌화최우적변작위하일조변주출적일폐도경．본문계수득도료자연감입도배면，Klein병화사영평면적방격자화삼각격자도적좌우로수．
Let G be a finite connected graph cellularly embedded in a closed surface. A left-right path in the embedded graph G is obtained by walking on edges of G, alternately selecting as next edge the leftmost edge and the rightmost edge. In this paper, we determine numbers of left-right paths of square and triangular lattices embedded in torus, Klein bottle and projective plane in a natural way.
