| 两类图的（d，1）-全标号 |
| |
| 引用本文： | 陈东. 两类图的（d，1）-全标号[J]. 浙江师范大学学报(自然科学版), 2008, 31(3): 283-287 |
| |
| 作者姓名： | 陈东 |
| |
| 作者单位： | 浙江师范大学行知学院,浙江,金华,321004 |
| |
| 摘 要： | 图G的一个k-（d，1）-全标号是一个映射f：V（G）∪E（G）→{0，1，…，k}，使得任意2个相邻的点和相邻的边有不同值，且任一对相关联的点和边的值差的绝对值至少为d．G的（d，1）-全标号数λ^Td（G）定义为G有一个k-（d，1）-全标号的最小的k值，得到了扇图与轮图的（d，1）-全标号数。
|
| 关 键 词： | (d,1)-全标号 距离2标号 扇图 轮图 |
The(d,1)-total labelling of two kinds of graphs |
| |
| CHEN Dong. The(d,1)-total labelling of two kinds of graphs[J]. Journal of Zhejiang Normal University Natural Sciences, 2008, 31(3): 283-287 |
| |
| Authors: | CHEN Dong |
| |
| Affiliation: | CHEN Dong ( Xingzhi College, Zhejiang Normal University, Jinhua Zhefiang 321004, China) |
| |
| Abstract: | The （ d, 1 ） -total labelling number λ^Td（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 （ d, 1 ） -total labelling numbers of the fan and wheel graphs were presented. |
| |
| Keywords: | （ d, 1 ） -total labelling distance two labelling fan graph wheel graph |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
