查询词典 adjacent

This article has four chapters,which mainly study totalcoloring and adjacent vertex distinguishing total coloirng of graphs.

本文分为四章，主要研究了图的全染色及邻点可区别全染色。

Let v be a vertex adjacent to u in C_n.

令v是一个在圈C_n中与u相邻的点。

Dominating set is an important concept in graph theory, which is defined as an a vertexsubset such that every other vertex not in it must be adjacent to some vertex in this subset.

控制集是图论中的重要概念，它定义为图中的一个点集，使得图中其它任何一点都与该点集中的某点相邻。

A nondegenerate simplex is one for which the set of edges adjacent to any vertex in the simplex forms a basis for the space.

一个非退化的单纯形是与任意顶点相连的边集组成空间的基。

Given an undirected graph,the vertex coloring problem is to assign a different color for vertex mutually adjacent.

图的顶点着色问题是指无向图中任意两个相邻顶点都分配到不同的颜色，这个问题是著名的NP 完全问题，没有非常有效的算法。

Triangleadj assumes that every other vertex is an adjacent vertex.

邻接三角形假设三角形每个顶点都有邻接的顶点。

In the litereture [2], Zhang Zhongfu introduced the conception of adjacent vertex distinguishing total coloring.

在文献[2]中张忠辅等提出了图的邻点可区别全染色的概念，即：设G是阶至少为2的连通简单图，k是正整数，f是V∪E到{1，2，…，k}的映射。

The problem of strong-distinguishable fullcoloring at the adjacent vertex of Cartesian product Pn×Pm of the path was discussed.

讨论路的笛卡尔积的邻点可区别的全染色问题，给出路的笛卡尔积Pn×Pm的邻点强可区别的全色数为χast=5 n=2，m≥2或m=n=36 min{n，m}≥3且m+n

A set S of vertices in a graph G is a dominating set of G if each vertex of V-SV(G is adjacent to some vertex of S.

图G的点集S如果满足：V|G|-S中每个点相邻于S中的某个点，则称点集S是一个控制集。

All the input data for each vertex in the individual primitive is available (i.e. 3 vertices for triangle), plus adjacent vertex data if applicable/available.

每个独立图元的每个顶点的所有输入数据都可以取到，并且在预先申明的情况下还附加了邻接顶点信息。

It was just a normal day of school

那只是上学的普通一天

Which is a very good reference in this issue.

这是一个在这个问题上很好的参考。