A distance irregular k-labeling of a graph G is a function f : V (G) → ¶1, 2, . . . , k♢ such that the weights of all vertices are distinct. The weight of a vertex v, denoted by wt(v), is the sum of labels of all vertices ...