adjacent vertices

Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices ( i.e., a clique) having the largest total weight.

给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集（团）具有最大权。

If the graph G had a proper edge colourings and the colouring sets of incident edges at all adjacent vertices of graph G are different from each other, the graph G is said to be a quasi-strong edge colourings.

如果图G有一个合理边上色，使图G的所有相邻顶点的关联边上色集合都互不相同，则称图G为准强边着色。

Based on the idea of statistics on the struc-ture, the clique histogram represents the distribution of one vertex with respect to its adjacent vertices, which can capture statistical information on the vertex level.

采用对结构进行统计的思路，首先定义团直方图来表示图的顶点到其邻接顶点之间的分布，捕捉顶点层次上的统计信息。

The simulation results show that Co atoms occupy firstly the central site, then diagonal lines or adjacent vertices positions, finally the vertices and edges as the increase of Co mole fraction. 2.

并且随着Co原子含量的增加，Co原子优先占据中心的位置，其次为对角线或邻近顶点的位置，最后为顶点和棱的位置。

Each information bit was embedded by modifying the difference of two adjacent vertices.

通过修改相邻顶点坐标的差值来实现数据隐藏.

These new vertices, which are adjacent to level 1 vertices, and so on.

这些新的顶点, 这是毗邻的第1级的顶点, 等等.

The dual bandwidth of a graph G, denoted by ( G), is the maximum value of the minimum labelling variance of any two adjacent vertices in G.

图G的对偶带宽是指图G中相邻两点最小标号差的最大值。

The adjacent vertex-distinguishing total coloring is the proper total coloring which demands the adjacent vertices with different color sets.

图的染色的基本问题就是确定其各种染色法的色数，图的邻点可区别全染色就是要求相邻顶点具有不同颜色集合的正常全染色。

The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfiying the sets of the colors of two adjacent vertices are different.

邻点可区别关联着色的定义是在关联着色的基础上提出的，是使得相邻顶点的颜色集不同的关联着色。

Removes the selected vertex from the curved line and reconnects the line between the two adjacent vertices

删除曲线上所选顶点并重新连接相邻两顶点间的线条