| 路的笛卡尔乘积图的邻点可区别全染色 |
| |
| 引用本文： | 程丽.路的笛卡尔乘积图的邻点可区别全染色[J].丽水学院学报,2006,28(2):11-13. |
| |
| 作者姓名： | 程丽 |
| |
| 作者单位： | 丽水学院,数理学院,浙江,丽水,323000 |
| |
| 摘 要： | 一个正常的全染色满足相邻顶点的顶点及其关联边所用的色集合不同时,称为邻点可区别全染色,其所用的最少的颜色数称为顶点可区别全色数。刻画了路与路的笛卡尔乘积图的邻点可区别全色数。
|
| 关 键 词： | 笛卡尔乘积图 邻点 全染色 全色数 |
| 文章编号： | 1008-6749（2006）02-0011-03 |
| 收稿时间： | 2005-10-27 |
| 修稿时间： | 2005-10-27 |
On Adjacent Vertex-distinguishing Total-coloring of Cartesian Product Graphs of Two Paths |
| |
| Cheng Li.On Adjacent Vertex-distinguishing Total-coloring of Cartesian Product Graphs of Two Paths[J].Journal of Lishui University,2006,28(2):11-13. |
| |
| Authors: | Cheng Li |
| |
| Institution: | College of Mathematics and Physics, Lishui University, Lishui Zhejiang 323000, China |
| |
| Abstract: | A total-coloring is called adjacent vertex-distinguishing if every two adjacent vertices are incident to different sets of colored vertex and incident edge with vertex.The minimum number of colors which were required for a adjacent vertex-distinguishing proper total coloring is called the adjacent vertex-distinguishing total chromatic number.We give a complete characterization for the adjacent vertex-distinguishing total chromatic number of the cartesian product graphs of two paths. |
| |
| Keywords: | Cartesian product adjacent total coloring total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
