关于几类特殊图的冠的邻强边染色

Adjacent strong edge coloring on the crowns of several kinds of particular graphs

设G是一个简单图,f是G的一个k—正常边染色,又满足对任意的uv∈E(G),都有C(u)≠C(v),则称f为G的一个邻强边染色,简称k-ASEC,且称xas'(G)=m inkG存在k-ASEC为G的邻强边色数,其中C(u)=f(uv)uv∈E(G).给出了路.圈、树、完全图、完全二分图、星、扇、轮的冠的邻强边染色数.

Let G be a simple graph,if f was a proper-k-edge coloring,for all uv∈E（G）,C（u）≠C（v）,then f was called k-adjacent strong edge coloring,k-ASEC for short,and x′as（G）=min{k｜G in k-ASEC} was called the adjacent strong edge chromatic number,where C（u）=f（uv）uv∈E（G）.The crowns of path,cycle,tree,complete bipartite graph,star,fan and wheel were discussed.