对图G(V，E)，若一正常k-染色f使得f［i］-f［j］≤1(i，j=1，2，…，k)，其中f［i］=｛vv∈V(G)且f(v)=i｝，f(v)表示顶点v的色，则称f为G(V，E)的k-均匀染色．图的均匀染色问题就是要确定使图G(V，E)具有k-均匀染色的最小的k．建立了图的均匀染色问题的神经网络模型算法．%Let G(V，E) be a graph，a k-proper coloring f is called a k-equitable coloring of G(V，E) if f［i］-f［j］≤1 (i，j=1，2，…，k)，where f［i］=｛vv∈V(G) and f(v)=i｝，f(v) denotes the color of vertex v∈V(G)．The equitable coloring problem is to calculate the minimum k for which there exists a k-equitable coloring of G(V，E)．A neural network model of equitable coloring problem is constructedx
展开▼
