For a graph G and two positive integers j and k an m-L j k -edge-labeling of G is an assignment from the set 0 1 … m-to the edges such that adjacent edges receive labels that differ by at least j and edges at distance two receive labels that differ by at least k.Theλ′j k-number of G denoted byλ′j k G is the minimum integer m overall m-L j k -edge-labeling of G.The necklace is a specific type of Halin graph.The L 1 2 -edge-labeling of necklaces is studied and the lower and upper bounds on λ′1 2-number for necklaces are given.Also both the lower and upper bounds are attainable.
