On total edge irregularity strength of polar grid graph

Abstract For a graph , an edge irregular total -labelling is a labelling for edges and vertices of a graph in such a way that the weights of any two different edges are distinct. The minimum for which admits an edge irregular total -labelling is called total edge irregularity strength of , . In this paper, the exact value of total edge irregularity strength of the polar grid graph was determined. We have also determined the total edge irregularity strength for a polar grid graph.


Introduction
Graph labelling is an extremely useful tool for making a lot of problems in different areas of human life very easy to be handled in a mathematical way. So, it is an important branch in graph theory and has a lot of applications in many fields, for instance, coding theory, astronomy, communication network and optimal circuit layouts.
A labelling of a simple, connected and undirected graph G(V, E) that is defined as a function that assigns some set of elements of a graph G with a set of positive or non-negative integer. According to a domain of a labelling, we have three types of it. The first one vertex labels if the domain is a vertex-set, the second is edge labelling when edge-set is the domain and finally, total labelling that its domain is the union of edge-set and vertex-set.
Bača et al. [1] defined an edge irregular total r−labelling of a graph G as a labelling θ : V ∪ E → {1, 2, 3, . . . , r} such that every two distinct edges lm and l * m * of a graph G have distinct weights, i.e. w θ (pq) = w θ (p * q * ). If a graph G admits an edge irregular total r-labelling and r is minimum then we say that G has a total edge irregularity strength denoted by tes(G). Furthermore, in [1], for any graph G, a lower bound of tes(G) is given by Since then, many authors try to find exact values for the total edge irregularity strength of graphs. Ivanĉo et al. [2] proved that tes(T) is equal its lower bound where T is any tree. In [3,4] authors determined the exact value of total edge irregularity strength for complete bipartite graph, complete graph and the corona of the path to path, a star and cycle. Ahmad et al. [5] determined tes(G) that G is generalized helm graph H m n with n ≥ 3, m ≥ 4. On the other hand, in [6][7][8] the total edge irregularity strengths for fan graph, wheel graph, triangular Book graph, friendship graph, centralized uniform theta graphs and large graphs are investigated. For definitions, applications and terminology are not mentioned in our paper, see [5,[8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26].
In this paper, the exact value of total edge irregularity strength of the polar grid graph was determined.

Main results
In this section, we determined the total edge irregularity strength of a polar grid graph P 3,n , n ≥ 3, and a polar grid graph P m,3 , m ≥ 3. Finally, the exact value of the total edge irregularity strength of a generalized polar grid graph P m,n was determined. Theorem 2.1: Let P 3,n be a polar grid graph with 3n + 1 vertices and 6n edges, n ≥ 3. Then For the inverse inequality, we sufficient to show the existence of an edge irregular total labelling with r = 2n + 1. Let r = 2n + 1 and π : V ∪ E → {1, 2, 3, . . . , r} is a total r-labelling defined as Obviously, all edges and vertex labels are at most r. Also, the weights of edges under the labelling π are given by: It is clear that the weights for any two different edges in P 3,n are distinct ( Figure 1). Therefore, π is an edge irregular total r-labelling f P 3,n . Hence To prove the invers inequality, we need to show that there exist an edge irregular total r-labelling, r = 2m + 1, for a graph P m, 3 . Suppose that r = 2m + 1 and π : V ∪ E → {1, 2, 3, . . . , r} is a total r-labelling. The proof is divided into three cases as follows: Define π as follows: .
It is easy to check that the greatest label is r. Next, the weights of edges of P m,3 are given by: fori ∈ {3, 6, 9, . . . , 3m}, It is easy to check that the edge-weights of edges are pairwise distinct. So, tes(P m,3 ) = 2m + 1.
It is clear that the largest label is r. The edge-weights are given by: 6, 9, . . . , 3m}.
It implies that the weights of edges are distinct. Then, tes(P m,3 ) = 2m + 1.
π is defined as follows: Obviously, the greatest label is r. Also, the weights of the edges of the graph P m,3 are given by: From the above equations it is clear that the edgeweights are distinct. So π is an edge irregular total r-labelling, r = 2m + 1. Hence tes(P m,3 ) = 2m + 1.
To prove the inverse of previous inequality, it is necessary to show that there exists an edge irregular total r-labelling for P m,n with r = 2mn+2 3 as follows: Let r = 2mn+2 3 and a total r-labelling η : V ∪ E → {1, 2, 3, . . . , r} is defined as: Obviously, the greatest label is r = 2mn+2 3 . The weights of the edges of P m,n expressed as: Upon checking, it was found that the weights of any two different edges are different. Hence η is an edge irregular total r-labelling for being r = 2mn+2 3 , i.e. tes(P m,n ) ≥ 2mn + 2 3 .

Conclusion
In this paper, we have determined the total edge irregularity strength for a polar grid graph P 3,n , n ≥ 3, and a polar grid graph P m,3 , m ≥ 3. Finally, the exact value of total edge irregularity strength for a generalized polar grid graph P m,n was determined.