Abstract
An edge irregular total k-labeling of a graph G = (V,E) is a labeling phi : V boolean OR E -> {1, 2,..., k} such that the total edge-weights wt(xy) = phi(x) + phi(xy) + phi(y) are different for all pairs of distinct edges. The minimum k for which the graph G has an edge irregular total k-labeling is called the total edge irregularity strength of G. In this paper, we determined the exact values of the total edge irregularity strength of hexagonal grid graphs.