The(2,1)-total labelling of the product of two kinds of graphs
Weifan Wang · Journal of Zhejiang Normal University · 2006
The(2,1)-total labelling number λ~t_2(G) of a graph G is the width of the smallest range of integers that suffices to label the vertices and edges of G such that no two adjacent vertices or two adjacent edges have the same labels and the difference between the labels of a vertex and its incident edges is at least 2.A complete characterization for the(2,1)-total labelling numbers of the Cartesian product of two cycles and the Cartesian product of two paths was given.