查询词典 vertices

A graph G is acyclically L-list colorable if for a given list assignment L there is an acyclic coloringπof the vertices such thatπ∈L.

若G有一个正常的无圈染色π，使得对每一个顶点v∈V，都有π∈L，则称G是无圈L-可染的或者称π是G的一个无圈L-染色。

Up to isomorphism, there is just one complete graph on vertices

在同构意义下，几个顶点的完全图只有一个。

Free form surface ; simple polygon ; concave vertices ; route planning

自由曲面；简单多边形；凹点；路径规划

By using the position information of concave vertices, a new algorithm for finding the kernel of a simple polygon was proposed,which could automatically select concave vertex to clip against polygon to obtain the kernel.

利用凹顶点间的位置信息，提出一种自动选择凹顶点来裁剪多边形的新求核算法。

The algorithm for detecting the convexity and concavity of vertices of a simple polygon is commonly used in computer graphics.

简单多边形顶点的凸、凹性判断是计算机图形学中常用的算法。

Given a hexagon circumscribed on a conic section , the lines joining opposite polygon vertices meet in a single point

已知一个六边形外切于一条圆锥曲线，那么连接这个六边形相对顶点的三条线交于一点。

Autonomous systems of the Internet form a huge complex network connected by physical links,in which the autonomous systems and links among them can be regarded as vertices and edges of an undirected graph.

因特网的自治系统(AutonomousSystem简称AS)构成了一个由物理链路连接起来的庞大的复杂网络，其中的自治系统及其之间的连接可以看作是无向图中的顶点和边。

A graph in which any two vertices are connected by a path is called connected graph.

一个图中如果任意两个顶点都有一条路相连，则称之为连通图。

For a connected graph G we denote by d the number of pairs of vertices at distance k.

设G是一个连通图，我们用记号d来表示图G中所有距离为k的顶点对的个数。

A simple connected graph is called bicyclic if it has n vertices and n + 1 edges.

双圈图是指边数等于顶点数加1的简单连通图。

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.

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