| 三类平方图的点边邻点可区别全色数 |
| |
| 引用本文： | 田京京. 三类平方图的点边邻点可区别全色数[J]. 数学的实践与认识, 2010, 40(12) |
| |
| 作者姓名： | 田京京 |
| |
| 基金项目： | 陕西省教育厅专项科研项目 |
| |
| 摘 要： | 根据平方图的结构性质,用穷染,递推的方法,讨论了路,圈,扇的平方图的点边邻点可区别全染色,得到了相应的色数,即并给出了一种染色方案.
|
| 关 键 词： | 平方图 点边邻点可区别全染色 点边邻点可区别全色数 |
Vertex-edge Adjacent Vertex-distinguishing Total Chromatic Number of the Three Kinds of 2-Power Graph |
| |
| Tian Jing-jing. Vertex-edge Adjacent Vertex-distinguishing Total Chromatic Number of the Three Kinds of 2-Power Graph[J]. Mathematics in Practice and Theory, 2010, 40(12) |
| |
| Authors: | Tian Jing-jing |
| |
| Abstract: | According to the properties of 2-power graph,the vertex-edge-adjacent vertex distinguishing total coloring of the 2-power graph P_n~2,C_n~2,F_n~2 are discussed by using color one by one and recursion,the vertex-edge-adjacent vertex distinguishing total chromatic number of the 2-power graph P_n~2,C_n~2,F_n~2 are obtained, the coloring method of the three kinds of 2-power graph are given. |
| |
| Keywords: | 2-power graph vertex-edge-adjacent vertex distinguishing total coloring vertexedge-adjacent vertex distinguishing total chromatic number |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
