顶点的

A connected graph G of order...

一个有n个顶点的连通图被称为路稠的如果它的任意一对顶点都能被长度为2，3，…，n-1的路连接。

In order to develop a new method for creating such an object normal form, the meaning of a vertex of the directed graph is extended, such that it is not only a simple vertex, but also a directed graph.

为了研究新的对象范式生成方法，对有向图顶点的含义进行了扩充，使其不仅可以是一个简单的顶点，还可以是一个有向图。

In this paper we prove Dirac conjecture for some special graphs in Which the numbers of ve-rtices are not more than 11, or have K or more vertices of degrees at least v-K-3 with v ≥9+K(K=1,2,3,), hence a proposition equivalent is given for it.

本文对顶点数不超过11或当v≥9+K(K=1，2，3)且G中至少含有K个次不小于v-K-3的顶点的特殊图证明了Dirac猜想，从而给出一个与Dirac猜想成立等价的命题。

Firstly, quadric surface is approximated with the vertex and its neighboring vertexes of the triangle mesh model, and the first and the second basic quantity are calculated, then estimating the normal and curvature of the mesh vertexes, lastly OpenGL technique is used in realizing the graphics display of the triangle mesh model.

首先根据三角网格模型中的顶点及其邻接点逼近二次曲面，并计算其第一、第二基本量，然后据此估算网格顶点的法失和曲率，最后利用OpenGL技术实现三角网格模型法矢和曲率的显示。

We defined a matrix in the normal field as the weights and consider that the different sampling rate has effect on the mesh smoothing.

在顶点的平滑过程中，每个顶点的权重采用一个定义在法向量场上的矩阵来表示，同时考虑了不同采样率对网格平滑的影响。

Continuing above curse, then we can get its optimum solution, that is to say, starting from some feasible vertex, we will get the optimum solution of some linear programming problem after finite times transition of vertex along edge of feasible region.

这就是说，自可行域的某顶点出发，沿可行域的棱经过若干次可行域顶点的转移后，就能得到线性规划问题的最优解。

A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices.

一个构形是面图的一连串连通的顶点与这些顶点的度。

A new feature angle criterion and local greedy triangulation method are presented to simplify vertexes of smooth polyhedral model.

提出了顶点的特征角定义方法、特征角准则及删除顶点后对遗留空洞的局部贪婪剖分方法，解决了多面体表示的光滑曲面模型的简化问题。

A 4 regular Hamiltonian planar map is a plannar map which is both 4 regular and Hamilitonian. A nearly 4 regular map is such a map that all of its vertices but the root vertex are 4 valent.

若一个平面地图的所有顶点是四次的，且又是哈密尔顿地图，则称该平面地图为四正则哈密尔顿平面图一个地图是近四正则的，是指除去根点外，其余顶点的次均为四。

A five-pointed star formed by five straight lines connecting the vertices of a ''.

五角星形一种有五个顶点的星形，由连接五边形各顶点的直线构成并包含另一个完整的五边形

If you are unfortunate enough to the lovelorn, please tell me, I will help you out, really, please contact me!

如果你不幸失恋了，请告诉我，我会帮助你摆脱困境，真的，请联系我啦！

China's plan to cut energy intensity by 20 percent and pollutant discharges by 10 percent between 2006 and 2010 is a case in point.

中国计划在2006年到2010间降低20%的能源强度和减少10%的主要污染物排放，就是一个这样的例子。