| 3-正则Halin图的可区别数 |
| |
| 引用本文： | 高志军,李懿,董军.3-正则Halin图的可区别数[J].兰州铁道学院学报,2009,28(1):153-156. |
| |
| 作者姓名： | 高志军 李懿 董军 |
| |
| 作者单位： | 黑龙江科技学院计算机与信息工程学院,黑龙江,哈尔滨,150027
|
| |
| 基金项目： | 黑龙江科技学院科研基金 |
| |
| 摘 要： | 根据3-正则Halin图的Hamilton性，结合其顶点间距离的关系，通过适当地选取顶点进行着色后得证了4和6阶以上3-正则Halin图G的可区别数分别为3和2．
|
| 关 键 词： | 图论 可区别数 Halin图 图着色 自同构群 |
On the Distinguishing Number of 3-regular Halin Graph |
| |
| GAO Zhi-jun,Li Yi,Dong Jun.On the Distinguishing Number of 3-regular Halin Graph[J].Journal of Lanzhou Railway University,2009,28(1):153-156. |
| |
| Authors: | GAO Zhi-jun Li Yi Dong Jun |
| |
| Institution: | College of Computer and Information Engineering;Heilongjiang University of Science and Technology;Harbin 150027;China |
| |
| Abstract: | 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. |
| |
| Keywords: | graph theory distinguishing number Halin graph graph coloring automorphism group |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
