A total k-labeling f that assigns V boolean OR E into {1,2, ...,k} on graph G is named vertex irregular if wt(f)(u) not equal wt(f)(v) for dissimilar vertices u, v in G with the weights wt(f) (u) = f(u) Sigma(ux is an ...