查询词典 adjacent 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 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.

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

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的邻点可区别关联色数。

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

According to the space distance between the metro structure and adjacent buildings, the degree of surface settlement and tilt of adjacent buildings caused by the construction of metro tunnel excavation, we divide the degree of adjacent buildings affected by a single metro tunnel construction into four adjacent grades, that is very nearby, quite adjacent, adjacent and nonadjacent, and give the criteria for the classification and the calculation method of the settlement and tilt of building close to metro.

依据地铁结构与邻近建筑物间的空间距离、地铁隧道暗挖施工引起地表沉降和邻近建筑物倾斜的程度，将受单个地铁隧道施工影响的邻近建筑物的邻近程度划分为很邻近、邻近、较邻近和不邻近4个邻近等级，并给出划分标准以及邻近地铁建筑物沉降及倾斜的计算方法。

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.

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

Multiple trials is the basic concept of many parallel simulated annealing. It is to perform multiple trials at the same time to search acceptable solutions. The division simulated annealing with no communication and The clustering simulated annealing are two common types of parallel simulated annealing methods. The division simulated annealing with no communication makes each processor generate its own adjacent solution from its own current solution and compute the acceptance probability for a adjacent solution. Each of the processors searches solutions without communicating each other. Clustering simulated annealing makes each processor generate its own adjacent solution from a common current solution and compute the acceptance probability for each adjacent solution. Then, it decides which adjacent solution should be used to replace current solution according to a pre-specified rule.

许多平行模拟退火法之理论依据为多向试验，利用同一时间探索更多方向的试验来拓展搜寻的广度或深度，不进行沟通的分工模拟退火法(the division simulated annealing with no communication)以及丛集模拟退火法(the clustering simulated annealing)皆为平行化的模拟退火法，前者定义为各个处理器针对各自的起始解进行搜寻，产生各自的搜寻序列，在搜寻过程中处理器不进行任何沟通，各处理器仅针对自身之目前解进行搜寻；而后者定义为让所有处理器针对同一目前解进行运算搜寻各自的可能解，并各自决定其产出解之接受机率，最后根据事先决定之规则进行沟通比较，挑选其中一个可接受解取代目前解。

In contrast to the ubiquitous rising-sun-with-rays military flag of the Japanese, Chinese banners and ensigns feature a range of designs.

与遍地都是的太阳军旗不同，中国人的旗帜和徽章设计得各式各样。

From their small corner of Feng's Guangzhou headquarters -- a jumble of pink leashes, squeezable rubber steaks, and plastic doggy Santas for Fido's stocking -- Soleil's designers come up with at least five new products a month.

从Feng 设在广州总部的产品展示柜台上可以看到，Soleil的设计师每月至少设计出5件新产品。