On the adjacent vertex distinguishing proper edge colorings of several classes of complete 4-partite and 5-partite graphs

摘要：

　　A proper k-edge coloring of a graph G is an assignment of k colors,1,2,…,k,to edges of G.For a proper edge coloring f of G and any vertex x of G,we use S(x) denote the set of the colors assigned to the edges incident to x.If for any two adjacent vertices u and v of G,we have S(u) ≠ S(v),then f is called the adjacent vertex distinguishing proper edge coloring of G (or AVDPEC of G in brief).The minimum number of colors required in an AVDPEC of G is called the adjacent vertex distinguishing proper edge chromatic number of G,denoted by Xa(G).In this paper,adjacent vertex distinguishing proper edge chromatic numbers of several dasses of complete 4-partite and 5-partite graphs are obtained.

关键词： complete 4-partite graphs complete 5-partite graphs proper edge coloring adjacent vertex-distinguishing proper edge coloring

作者: Xiang-en Chen Chunyan Ma Fang Yang Bing Yao

作者单位: College of Mathematics and Statistics Northwest Normal University Lanzhou, 730070, China

会议类型: 国际会议

会议名称: 2013 2nd International Symposium on Computer,Communication,Control and Automation(ISCCCA-13)(2013年第二届计算机、通信与自动化国际会议)

会议地点: 太原

会议语种:英文

页码: 128-131

在线出版日期: 2013-04-06（万方平台首次上网日期，不代表论文的发表时间）