期刊文献+

Mutation on Knots and Whitney's 2-Isomorphism Theorem

Mutation on Knots and Whitney’s 2-Isomorphism Theorem
原文传递
导出
摘要 Whitney's 2-switching theorem states that any two embeddings of a 2-connected planar graph in S2 can be connected via a sequence of simple operations, named 2-switching. In this paper, we obtain two operations on planar graphs from the view point of knot theory, which we will term "twisting" and "2-switching" respectively. With the twisting operation, we give a pure geometrical proof of Whitney's 2-switching theorem. As an application, we obtain some relationships between two knots which correspond to the same signed planar graph. Besides, we also give a necessary and sufficient condition to test whether a pair of reduced alternating diagrams are mutants of each other by their signed planar graphs. Whitney's 2-switching theorem states that any two embeddings of a 2-connected planar graph in S2 can be connected via a sequence of simple operations, named 2-switching. In this paper, we obtain two operations on planar graphs from the view point of knot theory, which we will term "twisting" and "2-switching" respectively. With the twisting operation, we give a pure geometrical proof of Whitney's 2-switching theorem. As an application, we obtain some relationships between two knots which correspond to the same signed planar graph. Besides, we also give a necessary and sufficient condition to test whether a pair of reduced alternating diagrams are mutants of each other by their signed planar graphs.
出处 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2013年第6期1219-1230,共12页 数学学报(英文版)
基金 Supported by National Natural Science Foundation of China(No.11171025) Science Foundation for the Youth Scholars of Beijing Normal University
关键词 Planar graph TWISTING 2-switching MUTATION Planar graph, twisting, 2-switching, mutation
  • 相关文献

参考文献12

  • 1Xu, J. M.: Theory and Application of Graphs, Kluwer Academic Publishers, Dordrechet-BostomLondon, 2003.
  • 2Graham, R. L., Grotschel, M., Lovasz, L.: Handbook of Combinatorics (Vol. 1), MIT Press, Massachusetts, 1996.
  • 3Whitney, H.: 2-Isomorphic graphs. Amer. Math. J., 55, 245-254 (1933).
  • 4Adams, C. C.: The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots, W. H. Freeman and Company, New York, 2004.
  • 5Gross, J. L., Yellen, J.: Graph Theory and Its Applications, Second Edition, Chapman & Hall/CRC, New York, 2006.
  • 6Truemper, K.: On Whitney's 2-isomorphism theorem for graphs. J. Graph Theory, 4(1), 43-49 (1980).
  • 7Thomassen, C.: Whitney's 2-switching theorem, cycle space, and arc mappings of directed graphs. J. Comb. Theory Set. B, 46(3), 257-291 (1989).
  • 8Mohar, B.: Combinatorial local planarity and the width of graph embeddings. Canad. J. Math., 44(6), 1272 1288 (1992).
  • 9Freyd, P., Yetter, D., Hoste, J., et al.: A new polynomial invariant of knots and links. Bull. Amer. Math. Soc., 12(2), 239-246 (1985).
  • 10Ruberman~ D.: Mutation and volumes of knots in S3. Invent. Math., 90, 189-215 (1987).

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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