一类3-正则图的邻强边染色

Adjacent Strong Edge Coloring of a Kind of 3-Regular Graphs

对简单图G(V,E),f是从V(G)∪E(G)到{1,2,…,k}的映射,k是自然数,若f满足(1)uv,uw∈E(G),u≠w,f(uv)≠f(uw);(2)uv∈E(G),C(u)≠C(v).则称f是G的一个邻强边染色,最小的k称为邻强边色数,其中C(u)={f(uv)|uv∈E(G)}.给出了一类3-正则重圈图的邻强边色数.

Let G be a simple graph,k is a positive integer.f is a mapping from V（G）∪E（G） to {1,2,…,k} such that：（1）uv,uw∈E（G）,v≠w,f（uv）≠f（uw）;（2）uv∈E（G）,C（u）≠C（v）.we say that f is the adjacent strong edge coloring;ofG.The minimal number of k is called the adjacent strong edge chromatic number;ofG,whereC（u）= {f（uv）｜uv∈E（G）}.In this paper,we discuss the adjacent strong;edge chromatic number of a kind of 3-regular repeated cycle graphs.