The(2,1)-total Labeling of Two Special Graphs
Liu Xiu-li · Journal of Yanbian University · 2011
We studied(p,1)-totallabeling of a graphs G,which related to frequency assignment problem of coloring problem.(p,1)-total labeling is an assignment from the set V(G)∪E(G) to the integer0,1,…,k,such that: ① any two adjacent vertices of G receive distinct integers;② any two adjacent edges of G receive distinctintegers;③ a vertex and its incident edge receive integers that differ by at least p in absolutevalue.The minimal number of k is called the(p,1)-total number of G.The(2,1)-total numbers of these graphs were given by the eternal coloring according to their feature.