查询词典 vertex

In this master thesis, we mainly discuss the adjacent vertex- distinguishing total chromatic numbers of some special graphs and prove that Zhang"s conjecture holds for these graphs. Then we get the adjacent vertex-distinguishing total chromatic numbers of the Halin Graphs. Moreover, we investigate the Generalized Petersen Graphs, prove that some classes of positive integers can"t structure the Generalized Petersen Graphs and get the result that the adjacent vertex-distinguishing total chromatic number is 5. Finally, based on the number and the parity of circles contained by the graph, we get the adjacent vertex-distinguishing total chromatic number of two classes of graphs.

本学位论文首先主要针对几个特殊图类讨论其邻点可区别全色数，验证了其满足图的邻点可区别全色数的猜想；再证明了非轮的Halin图的邻点可区别全色数；接着研究的是广义Petersen图，讨论了不能构成广义Petersen图的几类正整数，并证明了该图的邻点可区别全色数等于5；最后，根据图所含圈的个数及其奇偶性得到了两类图的邻点可区别全色数。

In Microsoft DirectX 9.0, the HAL can have three different vertex processing modes: software vertex processing, hardware vertex processing, and mixed vertex processing on the same device.

在 Microsoft DirectX 9.0 中，HAL 有三种的顶点处理方式：软件顶点处理、硬件顶点处理和同一设备的混合顶点处理。

This finds all the edges satisfying the condition that the first vertex index is less than the second vertex index when the direction from the first vertex to the second vertex represents a counterclockwise winding around the triangle to which the edge belongs.

这一发现的边缘满足所有的条件下，第一顶点指数低于第二顶点指数的方向时，从第一点第二点是一个逆时针缠绕在该三角形属于边缘。

This finds all the edges satisfying the condition that the first vertex index is greater than the second vertex index when the direction from the first vertex to the second vertex represents a counterclockwise winding around the triangle to which the edge belongs.

这一发现的边缘满足所有的条件下，第一顶点指数大于第二个顶点指数的方向时，从第一点第二点是一个逆时针缠绕在该三角形属于边缘。

This finds all the edges satisfying the condition that the first vertex index is less than the second vertex index when the direction from the first vertex to the second vertex represents a counterclockwise winding around the triangle to which the edge belongs.

当从第一个顶点到第二个顶点的方向表示该边所属三角形的逆时针方向时找到所有符合第一顶点的索引比第二个顶点索引小的边。

In this dissertation, we shall study the incidence coloring ofθ- graph, then we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs and determine the adjacent vertex distinguishing incidence chromatic number of some graphs.

本文研究了θ-图的关联着色，定义了图的邻点可区别关联着色及邻点可区别关联色数并确定了几类图的邻点可区别关联色数。

A hierarchy and circularity of data structure was presented by analyzed STL files and compared a several of frequently used data structures. The structure acquired from redundancy vertex was filtered by vertex sequence of quick sort, and vertex adjacent list and triangle face adjacent list was established.

通过对STL文件的分析和几种常用数据结构的比较，给出了一种层次环状数据结构，该结构是由快速排序顶点序列进行冗余顶点滤除，并建立顶点邻接表和三角面片邻接表而得到的。

If for any uv∈E, C_u≠C_v, then we callσis a k-adjacent vertex distinguishing incidence coloring of G andχ_=min{k| there exists a k- adjacent vertex distinguishing incidence coloring of G} is the adjacent vertex distinguishing incidence chromatic number of G.

若对任意uv∈E满足C_u≠C_v，则称σ为G的k-邻点可区别关联着色，并称X_=min{k|存在G的k-邻点可区别关联着色}为G的邻点可区别关联色数。

Applying the De Caen"s inequality of sum of the squares of the degree and Cauchy"s inequality, we obtain a strict lower bound and a strict upper bound of the largest Laplace eigenvalues only in terms of vertex number of a unicycle graph. Applying the Laplace matrix theorem of trees, we obtain an upper bound of the second smallest Laplace eigenvalues of a unicycle. Extremal graph whose second smallest Laplace eigenvalues reach the obtained upper bound is determined. We also obtain an upper bound of the second largest Laplace eigenvalues in terms of vertex number of the largest connected branch of unicycle graph, and obtain a theoretical method to calculate the second largest Laplace eigenvalues of unicycle graph. We obtain an upper bound of any Laplace eigenvalues in terms of vertex number of a unicycle graph. We also obtain the distribution of Laplace eigenvalues in the inter [0,n] in terms of the matching number.

本文得到了以下几个方面的结果： 1、利用图度平方和的De Caen不等式和Cauchy不等式给出单圈图的最大Laplace特征值仅依赖于顶点数的严格的上下界；利用树的Laplace理论给出了单圈图次小Laplace特征值的一个上界，并刻画了达到该上界的极图；利用子图的连通分支的顶点个数给出了单圈图次大Laplace特征值的一个上界，并给出了单圈图次大Laplace特征值一个理论上的一个求法；利用单圈图的阶数给出了其一般Laplace特征值的一个上界；利用单圈图的匹配数给出其Laplace矩阵谱在区间[0，n]上的分布情况。

If the vertex set of a graph can be partitioned into two disjoint nonempty sets V_(1) and V_(2), every vertex in V_(1) connects every vertex in V_(2) and there is no edge in V_(1) and V_(2), then we call this graph is a complete bipartite graph. If V_(1) contains m elements and V_(2) contains n elements, then we denote this complete bipartite graph K_.

当一个图中的点集合可以分成两个非空的集合V_(1)及V_(2)，若 V_(1)中的每一点都与V_(2)中的点有边相连，且在V_(1)及V_(2)中的点都没有边相连，则称此图为完全二分图；若 V_(1)中有m个点，V_(2)中有n个点，则此完全二分图记为K_。

Although translator has turned from being a crystal ball by which the original culture can unrestrainedly penetrate to another crystal ball by which the target culture can freely traverse, the translator's personal embodiment, in the process of cognitive act, are still absent in translation studies. Translators are still subjects without body or simply disembodied subjects.

译者虽然由原语文化可以自由穿透的玻璃球变成了译语文化可以自由穿越的玻璃球，但译者认知过程中的个体体验在翻译研究中依然缺席，译者依然仅仅是一个没有躯体体验的主体。

Chillingly, he claimed our technology is 'not nearly as sophisticated' as theirs and "had they been hostile", he warned 'we would be been gone by now'.

令人毛骨悚然的，他声称我们的技术是'并不那么复杂，像他们一样，和"如果他们敌意"，他警告说，'我们将现在已经过去了。