| 几类有趣图的邻点可区别全染色 |
| |
| 引用本文： | 董海燕,孙磊.几类有趣图的邻点可区别全染色[J].山东科学,2006,19(2):9-11. |
| |
| 作者姓名： | 董海燕 孙磊 |
| |
| 作者单位： | 山东师范大学数学科学学院,山东,济南,250014 |
| |
| 基金项目： | 国家自然科学基金(10471078) |
| |
| 摘 要： | 在正常全染色的定义下,使得任两相邻顶点的色集不同,这就是邻点可区别全染色.顶点v的色集是v的颜色其与及v关联的所有边的颜色.我们给出了几类有趣图的邻点可区别全色数.
|
| 关 键 词： | 简单连通图 邻点可区别全染色 邻点可区别全色数 |
| 文章编号： | 1002-4026（2006）02-0009-03 |
| 收稿时间： | 2005-12-18 |
| 修稿时间： | 2005-12-18 |
The adjacent vertex-distinguishing total coloring of some classes of funny graphs |
| |
| DONG Hai-yan,SUN Lei.The adjacent vertex-distinguishing total coloring of some classes of funny graphs[J].Shandong Science,2006,19(2):9-11. |
| |
| Authors: | DONG Hai-yan SUN Lei |
| |
| Institution: | School of Mathematics Science, Shandong Normal University, Jinan 250014, China |
| |
| Abstract: | Under the definition of proper total coloring of a graph,an adjacent vertex-distinguishing total coloring means that none of the two adjacent vertices is incident with the same set of colores.The coloring set of vertex v is the colors(assigned) to v and the edges incident to v.The adjacent vertex-distinguishing total chromatic number about some classes of funny graphs are provided. |
| |
| Keywords: | simple connected graph the adjacent vertex-distinguishing total coloring the adjacent vertex-distinguishing total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
