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

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

作　　者：李武装[1] 严谦泰[1] 

机构地区：[1]安阳师范学院数学与统计学院,河南安阳455000

出　　处：《湖南科技大学学报（自然科学版）》2011年第2期125-127,共3页Journal of Hunan University of Science And Technology：Natural Science Edition

基　　金：河南省自然科学基金项目(0511013800)

摘　　要：设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.

关 键 词：图 邻强边染色 邻强边染色数 

分 类 号：O157.5[理学—数学]