vertices

Based on the idea of statistics on the struc-ture, the clique histogram represents the distribution of one vertex with respect to its adjacent vertices, which can capture statistical information on the vertex level.

采用对结构进行统计的思路，首先定义团直方图来表示图的顶点到其邻接顶点之间的分布，捕捉顶点层次上的统计信息。

Therefore the vertices and adjacencies of each vertex are computed in the offline phase. Then the online phase simply searches the adjacencies of the old solution vertex for the new one.

因此，这个凸多面体的所有顶点及每个顶点的相邻顶点都可在离线阶段求出，于是在线阶段只需在当前解的相邻顶点中搜索新的解。

All these algorithms run in O ( logn) time using O ( n) processors, where n is the number of vertices in the tree.

对n个顶点的树，以上算法均使用O（n）个处理机，时间复杂度为O（logn）。

The Wiener index is the sum of distances between all pairs of vertices in a ( connected) graph.

Wiener指数是连通图的点对的距离之和。

If the graph G had a proper edge colourings and the colouring sets of incident edges at all adjacent vertices of graph G are different from each other, the graph G is said to be a quasi-strong edge colourings.

如果图G有一个合理边上色，使图G的所有相邻顶点的关联边上色集合都互不相同，则称图G为准强边着色。

A polyline in this drawing has too many vertices for conversion.

此绘图中的折线具有太多要转换的顶点.

Polyhedra with seven vertices are rare.

具有七个顶点的多面体是稀少的.

Once finished, we continued making the body extruding faces and modifying the vertices.

一旦结束, 我们继续开始通过挤压面和修改点来制作身体.

For a given graph G of order n, a routing R is a set of n ( n-1) elementary paths such that every ordered pair of vertices in G are connected by a path in the set.

对于给定的n阶连通图G，一个路由选择R是指G中的n（n-1）条路集，其中每个有序点对都有路集中的一条路连接。

The adjacent vertex-distinguishing total coloring is the proper total coloring which demands the adjacent vertices with different color sets.

图的染色的基本问题就是确定其各种染色法的色数，图的邻点可区别全染色就是要求相邻顶点具有不同颜色集合的正常全染色。

The dual bandwidth of a graph G, denoted by ( G), is the maximum value of the minimum labelling variance of any two adjacent vertices in G.

图G的对偶带宽是指图G中相邻两点最小标号差的最大值。

NB: a diagonal is a straight line joining two vertices not on the same side.

注: 对角线是连接两个不在同一边上的顶点的直线.

When a bone moves, the vertices attached to it also move.

当骨头移动时, 纳入它的顶点也随之移动.

Flip the order of triangle vertices so that the system traverses them clockwise from the front.

颠倒三角形顶点的顺序,这样系统可以从正面沿顺时针的方向去遍历他们.

Every graph has at least two vertices of same degree.

众所周知,任意顶点数大于1的图至少有两个点的度数相同.

Calculation of Euclidean Distance between Vertices Based on VCC

图像顶点链编码和顶点欧氏距离的计算

Alice wins the game if all vertices of the graph are legally colored , otherwise Bob wins.

否则,Bob赢.

Let u and v be nonconsecutive vertices on c.

设u和v是c上不相邻的两个顶点.

All the interior vertices are connected to exactly three vertices each.

所有三角形内的顶点恰好与三个顶点相联结.

Let DKv denote the symmetric complete directed graph with v vertices, the covering number C ( v, m) is a minimum number of covering DKv by m-circuits.

设DKv表示完全有向对称图，C（v，m）表示覆盖DKv的m长有向圈的最小圈数（称为覆盖数）。

Create surfaces. We use early created arrays as a set of vertices.

创建表面. 我们用之前建立好的数组作为顶点的设置.

These vertices, however, may not be distinct, as in the case where the endpoints may coincide.

但这两个顶点不一定是不相同的, 譬如在两个端点重合时的情况.

The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfiying the sets of the colors of two adjacent vertices are different.

邻点可区别关联着色的定义是在关联着色的基础上提出的，是使得相邻顶点的颜色集不同的关联着色。

Can I share position data between vertices with different texture coordinates?

我能够对于有不同纹理坐标的顶点共享相同的位置数据 吗 ?

Along with the direction change of the external wrench, the solution sequentially shifts from a vertex to one of its adjacencies, whereas the polytope with all its vertices remains unchanged.

随着外力旋量方向的变化，解不断地从一个顶点转移到它的一个相邻顶点，而凸多面体和它所有的顶点均保持不变。

Second the whole complexity is O ( k), where k is the number of the vertices.

其次整个的计算复杂度为O（k），其中k是顶点的数量。

The component we collapsed had at least two vertices.

我们毁掉的分支至少有两个顶点.

No control over the vertices once it enters into the pipeline.

程序员无法控制进入管道内的顶点.

In order to enhance the robustness against entities' deleting, vertices are divided into groups due to coordinate position, and the watermark is embedded repeatedly.

为了提高算法的抗剪切攻击能力，算法将顶点按坐标区域分组，在工程图中重复嵌入相同的水印信息。

A circ is an undirected graph having only vertices of even nonzero degree.

一广义圈是一无向图，其顶点次数都是非零偶数。