3-正则Halin图的边可区别数  

The edge distinguishing number of the 3-regular Halin graphs

作　　者：高志军[1] 李懿[1] 

机构地区：[1]黑龙江科技学院计算机与信息工程学院,黑龙江哈尔滨150027

出　　处：《高师理科学刊》2011年第1期43-45,共3页Journal of Science of Teachers＇College and University

基　　金：黑龙江科技学院科研基金资助项目(06-116)

摘　　要：根据3-正则Halin图的Hamilton性,结合其边的相邻关系,通过适当地选取边进行着色后证明了4和6阶以上3-正则Halin图G的边可区别数分别为3和2.According to the Hamilton property of the 3-regular graph,and combining with the adjacent relations of the edges,proven that the edge distinguishing number of 3-regular graphG is respectively 3 and 2 on 4 and above 6 vertices by selecting edges properly and coloring.

关 键 词：图着色 边可区别数 可区别数 HALIN图 

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