Some New Results on the (2,1)-Total Labeling of Graphs
Liu Xiu-li · Jiangnan daxue xuebao. Ziran kexue ban · 2011
The(p,1)-total labeling of graphs G,to be related to frequency assignment problem of coloring problem,was an assignment f from the set V(G)∪E(G) to the integer {0,1,2,…,k},such that: any two adjacent vertices of G receive distinct integers;any two adjacent edges of G receive distinct integers;and a vertex and its incident edge receive integers that differ by at least p in absolute value.The span of a(p,1)-total labeling is the maximum difference between two labels.The minimum of span of a(p,1)-total labeling of G is called the(p,1)-total number and denoted by λTp(G).The(2,1)-total numbers of some special graphs were given.