T11的不可定向亏格的计算
The Computation of the Nonorientable Genus of T11
DOI: 10.12677/AAM.2023.1211452, PDF,    国家自然科学基金支持
作者: 杨夏懿*：商洛学院数学与计算机应用学院，陕西 商洛；晁福刚#：商洛学院数学与计算机应用学院，陕西 商洛；华东师范大学数学系，上海
关键词: 嵌入；亏格；克莱因瓶；Embedding； Genus； The Klein Bottle
摘要: 一个图G的亏格g(G)(或不可定向亏格，也称叉冒数)是最小的整数g (或k)，使得G可以嵌入到曲面Sg (或Nk)上，且边为两两不交的简单闭曲线。借助于曲面嵌入图理论中的剪开和粘合的技巧，得到了11-圈的立方体图T11的不可定向亏格。
Abstract: The genus g(G) (or nonorientable genus , is also called crosscap number) of a graph Gis the smallest number g (or k) such that Ghas an embedding in Sg (or Nk) and the edges are simple closed curves which do not intersect except at a common vertex. We obtained the nonorientable genus of the cubic graph of 11-cycle, T11, using the technique of cut and identification in the theory of embedded graphs surfaces.
文章引用：杨夏懿, 晁福刚. T11的不可定向亏格的计算[J]. 应用数学进展, 2023, 12(11): 4617-4621. https://doi.org/10.12677/AAM.2023.1211452

参考文献

[1] Thomassen, C. (1992) The Jordan-Schönfies Theorem and the Classification of Surfaces. The American Mathematical Monthly, 99, 863-864. [Google Scholar] [CrossRef] 
[2] Thomassen, C. (1989) The Graph Genus Problem is NP-Complete. Journal of Algorithms, 10, 568-576. [Google Scholar] [CrossRef] 
[3] Mohar, B. and Thomassen, C. (2001) Graphs on Surfaces. Johns Hopkins University Press, Baltimore. [Google Scholar] [CrossRef] 
[4] Albertson, M.O. and Hutchinson, J.P. (1977) The Independence Ra-tio and Genus of a Graph. Transactions of the American Mathematical Society, 226, 161-173. [Google Scholar] [CrossRef] 
[5] Thomassen, C. (1994) Five-Coloring Graphs on the Torus. Journal of Combinatorial Theory, Series B, 62, 11-33. [Google Scholar] [CrossRef] 

为你推荐