| 树的Mycielski图的邻点可区别全色染色 |
| |
| 引用本文： | 谷玉盈,王淑栋.树的Mycielski图的邻点可区别全色染色[J].数学季刊,2008,23(4). |
| |
| 作者姓名： | 谷玉盈 王淑栋 |
| |
| 作者单位： | College;Information;Science;Engineering;Shandong;University;Technology;Qingdao;266510;China;Department;Mathematics;Tongji;Shanghai;200092; |
| |
| 基金项目： | Supported by Natural Science Foundation of China(60503002) |
| |
| 摘 要： |
|
| 关 键 词： | 树 Mycielski图 邻点 全色染色 |
Adjacent Vertex Distinguishing Total Coloring of M(Tn) |
| |
| GU Yu-ying,WANG Shu-dong.Adjacent Vertex Distinguishing Total Coloring of M(Tn)[J].Chinese Quarterly Journal of Mathematics,2008,23(4). |
| |
| Authors: | GU Yu-ying WANG Shu-dong |
| |
| Institution: | [1]College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao 266510, China [2]Department of Mathematics, Tongji University, Shanghai 200092, China |
| |
| Abstract: | A k-proper total coloring of G is called adjacent distinguishing if for any two adjacent vertices have different color sets.According to the property of trees,the adjacent vertex distinguishing total chromatic number will be determined for the Mycielski graphs of trees using the method of induction. |
| |
| Keywords: | total coloring adjacent vertex distinguishing total coloring Mycielski graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
