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.
给定顶点赋权的无向图,图的最大权团问题是寻找每个顶点都相邻的顶点子集(团)具有最大权。
应用推荐