The (2,1)-Total Labeling of Double Graph of Some Graphs

摘要

The (2,l)-total labeling number of a graph G is the width of the smallest range of integers that suffices to label the vertices and the edges of G 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 derive the (2,l)-total labeling numbers of double graph of some graphs.