| 轮图的（2，1）-全标号 |
| |
| 引用本文： | 徐春雷,王菊,冯伟,吉日木图. 轮图的（2，1）-全标号[J]. 内蒙古民族大学学报(自然科学版), 2009, 24(6): 615-616 |
| |
| 作者姓名： | 徐春雷 王菊 冯伟 吉日木图 |
| |
| 作者单位： | 内蒙古民族大学数学学院,内蒙古,通辽,028043 |
| |
| 摘 要： | 图G的一个后-（d，1）-全标号是一个映射f：V（G）∪E（G）→{0，1，…，k}，使得任意2个相邻的点和相邻的边有不同的值，且任一对相关联的点和边的值的差的绝对值至少为d．G的（d，1）-全标号数λd^T（G）定义为G有一个K-（d，1）-全标号的最小的k值，得到了轮图的（2，1）-全标号．
|
| 关 键 词： | (d, 1)-全标号 距离2标号 轮图 |
The(2,1)-total Labelling of Wheel Graphs |
| |
| XU Chun-lei,WANG Ju,FENG Wei,Jirimutu. The(2,1)-total Labelling of Wheel Graphs[J]. Journal of Inner Mongolia University for the Nationalities(Natural Sciences), 2009, 24(6): 615-616 |
| |
| Authors: | XU Chun-lei WANG Ju FENG Wei Jirimutu |
| |
| Affiliation: | XU Chun-lei,WANG Ju,FENG Wei,Jirimutu (College of Mathematics,Inner Mongolia University for Nationalities,Tonglaio 028043,China) |
| |
| Abstract: | The （d,1） -total labelling number λd^T（G） of a graph G is the width of the smallest range of integers that suffices to label the vertices and edges of G such that no two adjacent vertices or two adjacent edges have the same labels and the difference between the labels of a vertex and its incident edges is at least d.The （2,1）-total labelling numbers of Wheel graphs were presented. |
| |
| Keywords: | （d,1）-total labelling Distance two labelling Wheel graphs |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
