Author(s)

Sumei Zhang, Qiaoling Ma, Jihui Wang

.

The (2,1)-total labeling number of a graph is the width of the smallest range of integers that suffices to label the vertices and the edges of such that no two adjacent vertices have the same label, no two adjacent edges have the same label and the difference between the labels of a vertex and its incident edges is at least 2. In this paper, we studied the upper bound of of Sn+1∨Pm and Sn+1×Pm

Total Labeling, Join of Graph, Path Graph

S. Zhang, Q. Ma and J. Wang, "The (2,1) -Total Labeling of Sn+1∨Pm and Sn+1×Pm," Applied Mathematics, Vol. 1 No. 5, 2010, pp. 366-369. doi: 10.4236/am.2010.15048.