| 图D_(n,4)的邻点强可区别的全染色 |
| |
| 引用本文： | 张东翰.图D_(n,4)的邻点强可区别的全染色[J].商洛学院学报,2014(6):8-9. |
| |
| 作者姓名： | 张东翰 |
| |
| 作者单位： | 商洛学院数学与计算机应用学院 |
| |
| 基金项目： | 陕西省教育厅专项科研计划项目(14JK1225) |
| |
| 摘 要： | 通过分析图Dn,4的结构,利用穷举法和组合分析法讨论了图Dn,4的邻点强可区别的全染色,通过构造具体染色得到了图Dn,4的邻点强可区别的全色数。从而证明了图Dn,4的邻点强可区别的全色数是存在的。
|
| 关 键 词： | 穷举法 组合分析法 色数 |
Adjacent Vertex Strongly Distinguishing Total Coloring of Graph Dn,4 |
| |
| ZHANG Dong-han.Adjacent Vertex Strongly Distinguishing Total Coloring of Graph Dn,4[J].Journal of Shangluo University,2014(6):8-9. |
| |
| Authors: | ZHANG Dong-han |
| |
| Institution: | ZHANG Dong-han;College of Mathematics and Computer Application, Shangluo University; |
| |
| Abstract: | Through the analysis of graph Dn, 4, the adjacent vertex strongly distinguishing total coloring of graph Dn, 4is discussed by the exhaustion method an d the combination analytic method. The adjacent vertex strongly distinguishing total chromatic number of graph Dn, 4is gained by construction specific coloring,thus,the adjacent vertex strongly distinguishing total chromatic number of graph Dn, 4is existent. |
| |
| Keywords: | method of exhaustion combination analytic method chromatic number |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
