| 扇与轮的联图F_m ∨ W_n的均匀全色数 |
| |
| 引用本文： | 李成录,马刚.扇与轮的联图F_m ∨ W_n的均匀全色数[J].青海师范大学学报(自然科学版),2012,28(1):27-30. |
| |
| 作者姓名： | 李成录 马刚 |
| |
| 作者单位： | 1. 青海师范大学民族师范学院,青海共和,813000
2. 西北民族大学数学与计算机科学学院,甘肃兰州,730030 |
| |
| 摘 要： | 对一个正常的全染色满足各种颜色所染元素数（点或边）相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数.就扇与轮的联图Fm ∨ Wn,得到了在m,n不同取值情况下的均匀全色数.
|
| 关 键 词： | 联图 均匀全染色 均匀全色数 |
On the Equitable Total Chromatic Number of Fm ∨ Wn |
| |
| LI Cheng-lu,MA Gang.On the Equitable Total Chromatic Number of Fm ∨ Wn[J].Journal of Qinghai Normal University(Natural Science Edition),2012,28(1):27-30. |
| |
| Authors: | LI Cheng-lu MA Gang |
| |
| Institution: | 1.Qinghai Normal University National Teachers College,Gonghe 813000,China; 2.College of Mathematics and computer science,Northwest University for nationalities, Lanzhou 730030,China) |
| |
| Abstract: | A total-coloring is called equitable if‖Ti︱-︱Tj‖≤1,the ︱Ti︱ is called chromatic number of the icolor.The minimum number of colors required for an equitable proper total-coloring,a simple graph G is denoted byχet(G).In this paper,we have given the equitable total chromatic number of Fm ∨ Wn. |
| |
| Keywords: | oin-graph equitable total coloring equitable total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
