路和圈及星的全图的邻强边色数  

The Adjacent Strong Edge-chromatic Number on Total Graph of Path Cycle and Star

作　　者：安常胜 冯旭霞 

机构地区：[1]定西市第一中学数学教研组,甘肃定西743000

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

摘　　要：为了对图的全染色猜想的研究,提出了全图的概念.对一些特殊图的全图的邻点可区别的边染色作了研究,并且得到了确切的染色数,以及给出了一个邻点可区别的边染色法.In order to discuss the conjecture of total coloring of graph,the concept of total graph was proposed.In this paper,adjacent-distinguishing edge coloring of sveral particular graphs was studied,and the presisely chromatic numbers was obtained,a adjaceng-distinguishing edge coloring math was presented.

关 键 词：路圈 星 全图 邻强边染色 邻强边色数 

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