繁體版 English Francais한국어РусскийไทยViệt
登录 注册

亏格的英文

发音:  
"亏格"怎么读用"亏格"造句

英文翻译手机手机版

  • genus

例句与用法

  • On the irreducibility and reducibility on maximum genus of graphs
    关于图的最大亏格的可约与不可约性
  • The lower bounds of the maximum genus on graphs in terms of diameter and girth
    与直径和围长有关的最大亏格的下界
  • While , the determination of a graph ' s upper embeddablity is to determine a graph ' s maximum genus
    而确定一类图的上可嵌入性问题本身就是确定图的最大亏格问题。
  • For almost alternating knot , we proved that the genus of f equals zero when the number of components of f is less than eight
    对于几乎交错纽结,证明了当时,的亏格为零。
  • Then we generalized the result : the genus of f equals zero if only the topological graph of f is special simple
    然后将得以推广,只要的图是特殊简单的,就有曲面的亏格为零。
  • Maximum genus of graphs is a characteristic parameter , which determines a graph whether has a 2 - cell embedding in a . certain orientable surface
    图的最大亏格是刻划图在某个定向曲面上是否有2 -胞腔嵌入的一个特征参数。
  • This paper studied the properties of f by discussing the properties of f s . for alternating knot , the genus of f equals zero when the component of f is less than eight
    本文主要是通过讨论的性质来研究在交错纽结补中和几乎交错纽结补中的曲面的性质。对于交错纽结,当时,有的亏格为零。
  • Naturally , if there exists a face size more than 7 , then a worthy question arises " what about the upper bound of ( g ) ? or to say , what about the low bound on the maximum genus of g
    自然地,若一个图g在某个曲面嵌入中存在度超过7的面,一个值得回答的问题是: ( g )的上界情况怎样,或者等价地, g的最大亏格下界怎样
  • In 1951 , h . hopf proved , by associating a holomorphic 2 - differential to each constant mean curvature surfaces in r3 , that only compact genus zero surfaces immersed in r3 with constant mean curvature are the round sphere , in chapter two , we consider the same question about the compact 2 - type surfaces of genus zero in s7
    1951年, h . hopf发现r ~ 3中每个常平均曲率曲面都伴随一个全纯微分2 -形式,并证明了零亏格的常平均曲率闭曲面一定是r3中的球面.本文的第二章对于犷中零亏格的2型曲面讨论了类似的问题
  • Combining one or more parameters of a graph , many papers either present some upper embeddable graphs ~ [ 7 - 14 ] that is to say , they present the graphs , whose maximum genus reaches the best upper bound , or , they give a better low bound on the maximum genus of some graphs ~ [ 15 - 31 ] the first major result of this paper is that : combining vertex partition and degree of vertices of graphs , to study the upper embeddablity of graphs
    结合图的一个或多个参数,许多文献都给出了若干上可嵌入图类,即给出了最大亏格达到最好上界[ ( g ) 2 ]的图类;或给出一些图类的最大亏格的较好下界。本文的第一个主要结果,根据图的顶点划分和点的度的条件,研究图的上可嵌入性。
用"亏格"造句  

其他语种

亏格的英文翻译,亏格英文怎么说,怎么用英语翻译亏格,亏格的英文意思,虧格的英文亏格 meaning in English虧格的英文亏格怎么读,发音,例句,用法和解释由查查在线词典提供,版权所有违者必究。