| 图K_n\E(F_3)(n=17,19)的点可区别全染色 |
| |
| 引用本文： | 杨茂军.图K_n\E(F_3)(n=17,19)的点可区别全染色[J].甘肃科学学报,2010,22(2):29-31. |
| |
| 作者姓名： | 杨茂军 |
| |
| 作者单位： | 兰州市第四十四中学,甘肃,兰州,730070 |
| |
| 摘 要： | 一个图的全染色被称为点可区别的即对任意2个点的相关联元素及其本身所染颜色构成的集合不同.给出了图Kn\E(F3)(n=17,19)的一种点可区别全染色方法,利用此方法得出了图Kn\E(F3)(n=17,19)的点可区别全色数.
|
| 关 键 词： | 奇阶完全图 点可区别全染色 点可区别全色数 |
Vertex-distinguishing Total Coloring of Kn\E(F3)(n=17,19) |
| |
| YANG Mao-jun.Vertex-distinguishing Total Coloring of Kn\E(F3)(n=17,19)[J].Journal of Gansu Sciences,2010,22(2):29-31. |
| |
| Authors: | YANG Mao-jun |
| |
| Institution: | YANG Mao-jun(Lanzhou No.44 Middle School,Lanzhou 730070,China) |
| |
| Abstract: | A proper total coloring of a simple graph G is called vertex distinguishing if for any two distinct vertices u and v in G,the set of colore assigned to the elements incident to u and itself differs from the set of colors incident to v and itself.A vertex distinguishing total coloring approach is given for Kn／E（F3）（n=17,19）.By the approach,the vertex distinguishing total chromatic number of Kn／E（F3）（n=17,19） is obtained. |
| |
| Keywords: | complete graph of odd order vertex distinguishing total coloring vertex distinguishing total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
