| 图的邻点可区别全色数的一个上界 |
| |
| 引用本文： | 晁福刚,张忠辅,强会英.图的邻点可区别全色数的一个上界[J].纯粹数学与应用数学,2010,26(1):91-95,163. |
| |
| 作者姓名： | 晁福刚 张忠辅 强会英 |
| |
| 作者单位： | 井冈山大学数理学院,江西,吉安,343009;兰州交通大学数理学院,甘肃,兰州,730070 |
| |
| 基金项目： | 国家自然科学基金(10771091);;井冈山大学自然科学基金(JZ0801) |
| |
| 摘 要： | 图G的一个正常全染色被称为邻点可区别全染色，如果G中任意两个相邻点的色集合不同．本文用概率方法得到了邻点可区别全色数的一个上界．
|
| 关 键 词： | 邻点可区别全染色 邻点可区别全色数 Lov(u)sz局部引理 |
An upper bounds on the adjacent distinguishing total chromatic number |
| |
| CHAO Fu-gang,ZHANG Zhong-fu,QIANG Hui-ying.An upper bounds on the adjacent distinguishing total chromatic number[J].Pure and Applied Mathematics,2010,26(1):91-95,163. |
| |
| Authors: | CHAO Fu-gang ZHANG Zhong-fu QIANG Hui-ying |
| |
| Institution: | 1.College of Mathematics and Physics;Jinggangshan University;Ji'an 343009;China;2.Institute of Applied Mathematics;Lanzhou Jiaotong University;Lanzhou 730070;China |
| |
| Abstract: | A proper total coloring of the graph G is called adjacent vertex distinguishing total coloring,if any two adjacent vertices have different color sets.In this paper,an upper bound on the adjacent vertex distinguishing total chromatic number was obtained using the probability methods. |
| |
| Keywords: | adjacent vertex distinguishing total coloring adjacent vertex distinguishing total chromatic number the Lovasz local lemma |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
