一些倍图的邻强边染色  

The Adjacent Strong Edge Coloring on Some Double Graph

作　　者：冶建华[1] 马刚[1] 

机构地区：[1]西北民族大学数学与计算机科学学院,甘肃兰州730030

出　　处：《甘肃联合大学学报（自然科学版）》2013年第1期1-3,共3页Journal of Gansu Lianhe University :Natural Sciences

基　　金：西北民族大学中央高校基本科研业务费专项资金资助项目(ZYZ2012082;ZYZ2011082)

摘　　要：如果一个正常边染色满足相邻点的色集不同,则称为邻强边染色,其所用最少染色数称为邻强边色数.本文得到了星、扇和轮的倍图的邻强边色数.A proper edge coloring is called adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different, the minimum number of colors is called adjacent strong edge chromatic number. In this paper,the adjacent strong edge chromatic number of double graphs of star, fan, and wheel were obtained.

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

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