The (d , 1)-Total Labelling Of The Product Of Two Kinds Of Graphs

The k-(d, 1)-total labelling of a graph G is a mapping f:V(G)∪E(G)→{0,1,...,k}, such that any two adjacent vertices have different labels, any two adjacent edges have different labels, and any incident vertex and edge have the label different at least d. In this paper, we study the (d, 1)-total labelling. For the Cartesian Product of two cycles and the Cartesian Product of path and cycle, we obtain their (d, 1)-total labelling numbers(d≥3).