| 路和圈幂图的邻点可区别E-全染色 |
| |
| 引用本文： | 董秀芳. 路和圈幂图的邻点可区别E-全染色[J]. 海南大学学报(自然科学版), 2014, 32(3): 200-204 |
| |
| 作者姓名： | 董秀芳 |
| |
| 作者单位： | 江苏省联合职业技术学院连云港财经分院数学与应用数学系,江苏连云港,222003 |
| |
| 基金项目： | 江苏省联合职业技术学院连云港财经分院科研课题 |
| |
| 摘 要： | 以一个简单图G为基础,连接G的任意最短路长为k的2个顶点就可得到基础图G的k-幂图,研究了路的k-幂图和圈的2-幂图的邻点可区别E-全染色问题,并结合该类幂图的结构性质,运用构造法、反证法和穷举分类染色技术给出了其邻点可区别E-全色数,为确定图的各类染色问题提供了有效的借鉴.
|
| 关 键 词： | 幂图 邻点可区别E-全染色 邻点可区别E-全色数 |
Adjacent Points of Path and Cycle Power Graphs Distinguishing E-total Coloring |
| |
| DONG Xiu-fang. Adjacent Points of Path and Cycle Power Graphs Distinguishing E-total Coloring[J]. Natural Science Journal of Hainan University, 2014, 32(3): 200-204 |
| |
| Authors: | DONG Xiu-fang |
| |
| Affiliation: | DONG Xiu-fang;Department of Mathematics and Applied Mathematics,Lianyungang Financial Branch College of Jiangsu United Vocational College; |
| |
| Abstract: | Based on a simple graph G, if every couple of vertices, between which the minimal path length is k, are connected, k power graph is obtained. The problem of distinguishing E-total coloring with adjacent vertex of the k power graph of path and 2 power graph of cycle was analyzed. Considering the structure property of the power graph, the coloring methods of construction, contradiction, exhaustive classification were used to deter- mine the adjacent vertex distinguishing E-total chromatic numbers, which provided the effective references for the coloring of some graphs. |
| |
| Keywords: | power graph adjacent vertex distinguishing E-total coloring adjacent vertex distinguishing E-total chromatic number |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
