On the edge irregularity strength of grid graphs

For a simple graph G, a vertex labeling is called a vertex -labeling. For any edge in , its weight . If all the edge weights are distinct, then is called an edge irregular -labeling of . The minimum for which the graph has an edge irregular -labeling is called the edge irregularity strength of , denoted by . In this paper, we determine an exact value of edge irregularity strength for triangular grid graph , zigzag graph and Cartesian product .