- 更多网络例句与几何亏格相关的网络例句 [注：此内容来源于网络，仅供参考]
-
In this paper, firstly, the embeddability of near-triangular graphs on the orientable surface is studied. By using Petersen's Theorem about 1-factor, we first prove that for a near-triangulation on the orientable surface, its geometry dual graph has a 1-factor; then after a procedure of operation leaded by the 1-factor, we show that if a graph G triangulates some orientable surface S_g, then G has a near-triangular embedding in S_h for h = g,g + 1,...,β(G/2」, where β is the Betti number of G. Hence we obtain a conclusion: A near-triangulation of the orientable surface is upper-embeddable. As a generalization, a class of near-quadrangulation is studied, and similar results are obtained.
本文首先研究了近三角剖分图的可定向曲面嵌入性质，通过运用Petersen关于1-因子的定理，首先证明了对于可定向曲面上的三角剖分图，其几何对偶图具有1-因子；然后在1-因子的导向下，通过做一系列增加亏格的手术，证明了如果一个图G三角剖分可定向曲面S_g，那么G可以近三角剖分可定向曲面S_h，这里h=g，g+1，…，「β(G／2」，β是指图G的Betti数，从而得出推论：可定向曲面上的三角剖分图是上可嵌入的，作为推广，又研究了一类近四角剖分图的可定向曲面嵌入性质，并得到类似的结论。
- 更多网络解释与几何亏格相关的网络解释 [注：此内容来源于网络，仅供参考]
-
geometric genus：几何亏格
几何规划|geometric programming | 几何亏格|geometric genus | 几何码|geometric code