几类圈构造图的(p,1)-全标号

The(p,1)-Total Labeling of Few Kinds of Structured Cycle Graphs

一个图G的(p,1)-全标号是一个映射f∶V(G)∪E(G)→{0,1,…k},使得:G的任两个相邻的顶点得到不同的整数;G的任两个相邻的边得到不同的整数;一个点和它的邻边得到的整数至少相差p.(p,1)-全标号的跨度是指两个标号差的最大值.图G的(p,1)-全标号的最小跨度叫(p,1)-全标号数,记作λTp(G).给出了几类圈构造图的(p,1)-全标号.

A （p, 1 ） - total labeling of a cancel G is a mapping f： V（G） ∪ E（G） →{ 0,1,2 ,…k} such that：any few adjacent vertices of G receive distinct integers; any few adjacent edges of G receive distinct integers;and a vertex and its incident edge receive integers that differ by at least p in absolute vohe. The span of a （p, 1 ） - total labeling is the maximum difference between few labels. The minimum of span a （p, 1 ） -total labeling of G is called the （p,1） -total number and denoted by λP^T（G）. The （p, 1） -total numbers of few kinds of cycle structured graphs are given.