3-正则Halin图的可区别数  

On the Distinguishing Number of 3-regular Halin Graph

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

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

出　　处：《兰州交通大学学报》2009年第1期153-156,共4页Journal of Lanzhou Jiaotong University

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

摘　　要：根据3-正则Halin图的Hamilton性,结合其顶点间距离的关系,通过适当地选取顶点进行着色后得证了4和6阶以上3-正则Halin图G的可区别数分别为3和2.According to the Hamilton property of the 3-regular Halin graph, and combined with the relations of the distance between its vertices, the distinguishing number of 3-regular graph G is proved and obtained, which is respectively 3 and 2 on 4 and above 6 vertices by selecting vertices properly and coloring.

关 键 词：图论 可区别数 HALIN图 图着色 自同构群 

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