The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfiying the sets of the colors of two adjacent vertices are different.
邻点可区别关联着色是使得相邻顶点的颜色集不同的关联着色。
A proper edge coloring of a graph is called an adjacent strong edge coloring if no two of its adjacent vertices are incident with edges colored by the same set of colors.
如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。
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.
给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集(团)具有最大权。
Two vertices are said to be adjacent to one another if they are connected by a single edge.
如果两个顶点被同一条边连接，就称这两个顶点是邻接的。
This algorithm removes vertices of the mesh according to the curvature of the vertex weighted by the area of the triangles which are adjacent to that vertex.
对于网格模型简化问题，本文提出了一种基于网格顶点曲率加权该顶点邻接三角形面积的顶点删除简化算法。
This algorithm removes vertices of the mesh according to the curvature of the vertex weighted by the area of the triangles which are adjacent to that vertex.
对于网格模型简化问题，本文提出了一种基于网格顶点曲率加权该顶点邻接三角形面积的顶点删除简化算法。
应用推荐