查询词典 vertices

Let Kv be a complete graph with v vertices, G be a simple subgraph without isolate vertices of Kv.

设Kv是一个v个点的完全图， G为一个不含孤立点的简单图。

For example, say we wish to know if two vertices in a graph of n vertices are in the same connected component of the graph.

举个范例，我们希望知道一个有 n 个顶点的图形中的两个顶点是否位於图中同一个连接元件。

In chapter four,we have studied the permutation group coset method in calculations of gauge field vertices which can simplified the calculation of gluonic vertices.Using this method we derived the Feynman rules of trilinear vertex and quartic vertex of gauge theory.

第四章给出了规范场顶角计算中的置换群陪集展开方法，利用该方法可以简化胶子顶角的计算，并导出了规范场的三点及四点树图顶角的Feynman规则。

This thesis contributes to geometry compression in the following aspects: Proposes a method of progressive spherical mesh parameterization based on local parameterization by directly projecting the deleted vertices to its neighborhood. Based on spherical mesh paramterization, an adaptive subdivision remeshing method by progressivly redistributing of sampling points is proposed, by this means, the main geometry information of the original mesh can be captured with only a small amount of samples, it can also be used in mesh simplification. By regarding attributes binded on mesh vertices as geometry signals and transferring them onto a uint sphere by means of spherical mesh parameterization, meshes with different attributes are compressed with spherical wavelet successfully with high compression rate. As a kind of lossy geometry compression technique, two mesh simplification algorthimes are also presented in this thesis.

归纳起来，本文的主要贡献有：提出了以直接投影局部参数化方法为基础的网格累进球面参数化方法；在网格球面参数化方法的基础之上，提出了一种基于累进优化布点方案的网格细分采样方法，该方法可以用很少的采样点就可以捕获到网格的主要特征，因此我们也将其用于后面的网格简化工作当中；通过将网格顶点上定义的各种属性看成几何信号，并以网格球面参数化为手段将几何信号迁移到单位球面上，从而成功地实现了用球面小波对各种几何信号的压缩；作为一种有损压缩方法，本文还提出了基于统一距离的网格简化算法和基于重采样的网格简化算法。

The components of the Fiedler vector were weighted on the corresponding vertices of graph such that differences of the components provide information about the distances between the vertices.

摘 要：在多水平方法初始剖分阶段提出了一种基于谱方法的无向赋权图剖分算法SPWUG，给出了基于Lanczos迭代计算Laplacian矩阵次小特征值及特征向量的实现细节。

Let λK_v be the complete multigraph with v vertices where any two distinct vertices x and y are joined by λ edges.

设λK_ν是λ重ν点完全图，其任意两个不同顶点x和y间都恰有λ条边相连。

So with the adjacency matrix that has n vertices of a directed graph n2 units needed to store the adjacency matrix; on n vertices have an undirected graph Zexu into upper triangle, and only ...

因此用邻接矩阵来表示一个具有n个顶点的有向图时需要n2个单位来存储邻接矩阵；对有n个顶点的无向图则需存入上三角形，故只。。。

This paper proved that the MAXIS algorithm is a 2-approximation to the SC of proper interval graphs with Bounded Degree and α≤ω. where α is the maximum degree of vertices of graph, n is the number of vertices of graph.

本文证明了对一类特殊的真区间图Δ≤(4n~(1/4)且α≤ω，其中Δ是图G中点的最大次，n是图G的点数，α是G的最大独立点集所包含的点数，ω是G的最大团所包含的点数，MAXIS算法是解决其染色和问题的2-近似算法。

In 1997, Lenhard Ng Michelle Schultz[1] gave the definition of k -ordered Hamilton graphs,namely, let G be a Hamiltonian graph of order n,and for a positive integer k with k ≤n, we say that G is k -ordered if for every sequence S : v1 , v2,Λ,vk of k distinct vertices, there exists a hamiltonian cycle C of G such that the vertices of S are encountered on C in the specified order.

年， Lenhard Ng Michelle Schultz[1]给出k-可序( k ？ordered)哈密尔顿图的定义，即设G是n阶哈密尔顿图，对于正整数k，称G 是k -可序图，如果对于任意给定的k 个互不相同的顶点的有序子集S =( v1 ，v2，Λvk)( 2≤k ≤n)，存在G中的哈密尔顿圈C 包含S 且不改变其中元素的顺序。2000 年，R.J。

The parent element is divided into four sub-areas,and the natural coordinates of the vertices of the sub-areas and the shape functions are used to calculate the temperature at the vertices of corresponding sub-areas in real coordinate system.

首先把母元等分成4个子块，然后利用子块顶点的自然坐标和单元的形函数，求出实际单元中对应子块的顶点温度，利用子块顶点温度判断是否有等值线通过。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。