期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

几种曲面上的方格和三角格的左右路的计数(英文) 被引量：5

Enumeration of Left-right Paths of Square and Triangular Lattices on Some Surfaces
下载PDF
导出
摘要 设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.
作者 蒋乐萍 金贤安
机构地区 厦门大学数学科学学院
出处 《数学研究》 CSCD 2011年第3期257-269,共13页 Journal of Mathematical Study
基金 supported by NSFC(10831001) the Fundamental Research Funds for the Central Universities(2010121007)
关键词 计数 左右路 格子图 闭曲面 环面链环 Enumeration Left-right paths Lattices Closed surfaces Torus link
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献15

  • 1Shank H. The theory of left-right paths. Combinatorial Math. III, Lecture Notes in Mathematics. Berlin: Springer-verlag, 1975, 452: 42-54.
  • 2Vergnas M L. On Eulerian partitions of graphs. Graph theory and combinatorics, Research Notes in Mathematics. Pitman Advanced Publishing Program, 1979, 34: 62-75.
  • 3Pisanski T, Tucker T W, Zitnik A. Straight-ahead walks in Eulerian graphs. Discrete Math., 2004, 281: 237-246.
  • 4Endo T. The link component number of suspended trees. Graphs and Combinatorics, 2010, 26: 483-490.
  • 5Noble S D, Welsh D J A. Knot graphs. J. Graph Theory, 2000, 34: 100-111.
  • 6Richter R B. Spanning trees, Euler tours, medial graphs, left-right paths and cycle space. Discrete Math., 1991, 89: 261-268.
  • 7Tutte W T. A contribution to the theory of chromatic polynomials. Canad. J. Math., 1954, 6: 80-91.
  • 8Mphako E G. The component number of links from graphs. Proc. Edinb. Math. Soc., 2002, 45: 723-730.
  • 9Jin X, Dong F M , Tay E G. Determining the component number of links corresponding to lattices. J. Knot Theory Ramifications, 2009, 18(12): 1711-1726.
  • 10Jiang L, Jin X, Deng K. Determining the component number of links corresponding to triangular and honeycomb lattices. J. Knot Theory Ramifications, accepted for publication.

同被引文献46

  • 1袁名焱,罗秋红,汤自凯.由星补刻画的一类广义线图[J].湖南师范大学自然科学学报,2012,35(1):13-16. 被引量：2
  • 2MURASUGI K. Knot theory and its applications[ M]. Boston:Birkhauser, 1996:34-39.
  • 3SHANK H. The theory of left-right paths[ J]. Combinatorial Math. Ⅲ, Lecture Notes in Mathematics, 1975, 452:42-54.
  • 4PISANSKI T, TUCKER T W, ZITNIK A. Straight-ahead walks in Eulerian graphs[J]. Discrete Math, 2004,281 (1-3) :237- 246.
  • 5JINX A, DONG F M, TAY E G. On graphs determining links with maximal number of components via medial construction [ J ]. Discrete Appl Math, 2009,157 (14) :3099-3110.
  • 6ENDO T. The link eomvonent number of susoended trees[ J]. Gravh Combinator. 2010.26(4) :483-490.
  • 7LIN Y F, NOBLE S D, JINX A, et al. On plane graphs with link component number equal to the nullity[J]. Discrete Appl Math, 2012,160(9) :1369-1375.
  • 8JIN X A, DONG F M, TAY E G. Determining the component number of links corresponding to lattices [ J ]. J Knot Theor Ramif, 2009,18 (12) : 1711-1726.
  • 9JIANG L P, JINX A, DENG K C. Determining the component number of links corresponding to triangular and honeycomb lat- tices [ J ]. J Knot Theor Ramif, 2012,21 (2), 1250018 -1250031.
  • 10MPHAKO E G. The component number of links from graphs[ J ]. Proc Edinb Math Soc, 2002,45 (3) :723-730.

引证文献5

二级引证文献4

数学研究
2011年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部