若干n重积图的点可区别边色数

The Vertex-Distingquishing Edge Chromatic Number of Some n-Multiple Product Graphs

通过研究若干n重积图的边色数及点可区别边色数,就可证明■(Gi)=△(Gi),i=1,2,L,n,则∑=′×××=■△(G_i)其中G1×G2×L×Gn为G1,G2,L,Gn的n重积图.

The edge chromatic number and the vertex-distinguishing edge chromatic number of some product graphs were studied in this paper. It has been proven that if χ ′vd ( Gi )=?(Gi),i=1,2,L,n, then ∑=′ ×××=n?ivd GGGnGi1χ ( 1 2L)() Where G 1 × G2×L×Gn is the n -multiple product of graphs G1 , G2,L ,Gn.