说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 句库 -> 顶点数
1.
Every graph has at least two vertices of same degree.
众所周知,任意顶点数大于1的图至少有两个点的度数相同。
2.
The New Lower Bound of the Number of Vertices of Degree 6 in Contraction Critical 6 Connected Graphs;
收缩临界6连通图中6度顶点数新的下界
3.
A LOD Algorithm for Large Scale Ocean Based on OpenGL Index Vertex Array
基于OpenGL索引顶点数组的大尺度海面LOD算法
4.
Ordering of Unicyclic Graphs with Cycle Length g and Vertices n
圈长和顶点数给定的单圈图的Laplace谱半径排序
5.
Bounds for two multicolor vertex Folkman numbers
两个多色顶点Folkman数的界
6.
Lie Algebraic Structure on Weight 1 Subspace of Lattice Vertex Algebra and Its Realization of Vertex Algebra Structure
格顶点代数权—空间上的李代数结构及其上的顶点代数结构的实现
7.
Affine Lie Algebra (?)_8 and Its Vertex Operator Algebra;
仿射李代数(?)_8及其顶点算子代数
8.
The Generalized Vertex Algebras from Affine Lie Algebra with Short Roots;
有短根的仿射李代数的广义顶点代数
9.
Vertex Operator Representations of 3-twisted Affine Lie Algebra (?)[θ] and Modules for Vertex Algebra;
3-twisted仿射李代数(?)[θ]的顶点算子表示和顶点代数模
10.
The algorithm iteratively perturbs every control point to reshape the control net by inputting data points one by one.
逐个输入数据点后,通过对控制顶点进行扰动来求取新的控制顶点。
11.
Ordered Adjacency Vertex List Structure for Subdivision Surfaces
细分曲面的有序邻接顶点表数据结构
12.
The Estimation of the Number of Vertices as Its Edge-Cohesiveness ≤1 in a Graph
具有棱凝聚度≤1的顶点之个数估计
13.
Vertex Representations for Toroidal Lie Algebra of Type G_2;
G_2型Toroidal李代数的顶点表示
14.
Realization of Vertex Operators of 7-Twisted Affine Lie Algebra (?) [θ];
7-Twisted仿射李代数(?)[θ]的顶点算子实现
15.
We shall present some of the basic properties of the vertex and edge chromatic numbers.
我们将介绍顶点色数和边色数的一些基本性质。
16.
A circ is an undirected graph having only vertices of even nonzero degree.
一广义圈是一无向图,其顶点次数都是非零偶数。
17.
A New Construction of a Vertex Algebra of 3-twisted Affine Lie Algebra sl(?) [θ];
3-twisted仿射李代数sl(?)[θ]的一种新的顶点代数构造
18.
Representations of Vertex Operator Superalgebras and Associative Algebras
顶点算子超代数及相关的结合代数的表示