| 图P2n的邻点可区别I-全染色 |
| |
| 引用本文： | 丁丹军.图P2n的邻点可区别I-全染色[J].咸阳师范专科学校学报,2013(6):15-17. |
| |
| 作者姓名： | 丁丹军 |
| |
| 作者单位： | 连云港师范高等专科学校数学与信息工程学院,江苏连云港222000 |
| |
| 基金项目： | 连云港师范高等专科学校科研基金项目（LYGSZ13035）. |
| |
| 摘 要： | 图的染色是图论中非常重要的研究课题,图的染色的基本问题即是确定各种染色法的色数.图G的邻点可区别I-全染色是一个新的染色概念,对二幂图P2n的邻点可区别I-全染色问题进行了研究,从其结构特点出发,运用构造法和色调整技术,给出了P2n的邻点可区别I-全染色法,得到了P2n的邻点可区别I-全染色数.
|
| 关 键 词： | 幂图 邻点可区别I-全染色 邻点可区别I-全色数 |
Adjacent Vertex-distinguishing I-total Coloring of P2n |
| |
| DING Dan-jun.Adjacent Vertex-distinguishing I-total Coloring of P2n[J].Journal of Xianyang Teachers College,2013(6):15-17. |
| |
| Authors: | DING Dan-jun |
| |
| Institution: | DING Dan-jun (School of Mathematics and Information Engineering, Lianyungang Teacher＇s College, Lianyungang 222000, Jiangsu,China) |
| |
| Abstract: | The graph coloring problem is an important research subject in graph theory. The criti- cal problem of graph coloring is to acquire the chromatic number of kinds of coloring methods. The ad- jacent vertex-distinguishing/-total coloring of the two power graph of Path（ p Z ） is discussed based on the structure of P~, and the adjacent vertex-distinguishing/-total chromatic number of pZ is con- firmed by the methods of construction and coloring adjustmention. |
| |
| Keywords: | /-total coloring adjacent vertex-distinguishing/-total coloring adjacent vertex-distin-guishing/-total chromatic number |
| 本文献已被 维普 等数据库收录！ |
