| 3-正则Halin图的边可区别数 |
| |
| 引用本文： | 高志军,李懿. 3-正则Halin图的边可区别数[J]. 高师理科学刊, 2011, 31(1): 43-45. DOI: 10.3969/j.issn.1007-9831.2011.01.013 |
| |
| 作者姓名： | 高志军 李懿 |
| |
| 作者单位： | 黑龙江科技学院,计算机与信息工程学院,黑龙江,哈尔滨,150027 |
| |
| 基金项目： | 黑龙江科技学院科研基金资助项目(06-116) |
| |
| 摘 要： | 根据3-正则Halin图的Hamilton性,结合其边的相邻关系,通过适当地选取边进行着色后证明了4和6阶以上3-正则Halin图G的边可区别数分别为3和2.
|
| 关 键 词： | 图着色 边可区别数 可区别数 Halin图 |
The edge distinguishing number of the 3-regular Halin graphs |
| |
| GAO Zhi-jun,LI Yi. The edge distinguishing number of the 3-regular Halin graphs[J]. Journal of Science of Teachers＇College and University, 2011, 31(1): 43-45. DOI: 10.3969/j.issn.1007-9831.2011.01.013 |
| |
| Authors: | GAO Zhi-jun LI Yi |
| |
| Affiliation: | GAO Zhi-jun,LI Yi(School of Computer and Information Engineering,Heilongjiang of Science and Technology,Harbin 150027,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | graph coloring edge distinguishing number distinguishing number Halin graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
