(p,1)-Total Labelling of 2-connected Outerplanar Graphs with Maximum Degree 3
Lei Sun · Journal of Hainan Normal University · 2009
A(p,1)-total labelling of a graph G is an assignment of inters to V(G)∪E(G) such as:(1) any two adjacent vertices of G receive distinct integers,(2) any two adjacent edges of G receive distinct integers,and(3) a vertex and its incident edge receive integers that differ by at least p in absolute value.The span of a(p,1)-total labelling is the maximum difference between two labels.The minimum span of a(p,1)-total labelling of G is called the(p,1)-total number and denoted by λpT(G).This paper shows the(p,1)-total number of 2-connected outerplanar graph with maximum degree 3 .