saturated vertex

saturated vertex的基本解释

-

饱和顶点

与saturated 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.

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

与saturated vertex相关的网络解释 [注：此内容来源于网络，仅供参考]

saturated vertex：饱和顶点

saturated subset 浸润子集 | saturated vertex 饱和顶点 | saturation curve 饱和曲线