邻点的英文

• adjacent points; neighbouring points

• "点"英文翻译    drop
• "内邻点" 英文翻译 :    in-neighbour
• "外邻点" 英文翻译 :    out-neighbour
• "相邻点" 英文翻译 :    consecutive point
• "相邻点间相对中" 英文翻译 :    relative mean square error of
• "自然邻点插值法" 英文翻译 :    natural neighbor
• "邻顶" 英文翻译 :    adjacent vertex
• "邻碘酰苯甲酸" 英文翻译 :    ibx
• "邻顶点" 英文翻译 :    adjacent vertex
• "邻碘硝基苯" 英文翻译 :    o-iodonitrobenzene
• "邻端衰减" 英文翻译 :    neighboring terminal attenuation
• "邻碘马尿酸酯" 英文翻译 :    orthoiodohippurate
• "邻对" 英文翻译 :    adjacency pair
• "邻碘马尿酸盐、酯或根" 英文翻译 :    o-iodohippurate
• "邻对滴滴滴" 英文翻译 :    ortho-para-prime ddd
• "邻碘马尿酸盐" 英文翻译 :    oih; orthoiodohippurate

• Thus the value of the function at any grid point is the average of its values at the immediately neighboring points .
  因此，任一结点上的函数值就等于其直接邻点上函数值的平均。
• Interpolation ; voronoi cells ; natural neighors
  插值voronoi cells自然邻点
• Adjacent - vertex - distinguishing total chromatic numbers of k2n 1 - e 2k
  的邻点可区别全色数
• On adjacent vertex - distinguishing total colorings of graphs pm 215 ; pn
  的邻点可区别全染色
• The adjacent vertex - distinguishing total coloring of special graphs
  几类特殊图的邻点可区别全染色
• On adjacent vertex - distinguishing total coloring of three special graphs
  三类特殊图的邻点可区别全染色
• Some new results on the adjacent vertex - distinguishing total coloring of graphs
  关于邻点可区别全染色的几个新结果
• A note on the upper bound of adjacent vertex distinguishing chromatic number of graphs
  关于图邻点可区别上界的一点注
• We obtain the adjacent - vertex distinguishing total chromatic numbers with the first moment principle , markov ' s inequality and some kinds of lovasz local lemma , respectively
  ) sz局部引理分别得到了任一最大度为d的图g的邻点可区别的全色数。
• Markov ' s inequality and some kinds of lovasz local lemma , respectively . in the last part , we discuss a new concept " adjacent - vertex distinguishing total colorings "
  第四部分引入了邻点可区别的全染色这一新的概念，并用第一矩量原理， markov不等式以及几种形式的lov (