For a simple graph G, a vertex labeling ? : V (G) ? {1, 2, . . . , k} is called k-labeling. The weight of an edge xy in G, written w?(xy), is the sum of the labels of end vertices x and y, i.e., w?(xy) = ?(x) + ?(y). A ...