Abstract
Edge Even Graceful Labelingwas first defined by Elsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph G with p vertices and q edges is a bijection f from the edges of the graph to the set {2, 4,...,2q} such that, when each vertex is assigned the sum of all edges incident to it mod2r where r = max {p, q}, the resulting vertex labels are distinct. In this paper we proved necessary and sufficient conditions for the polar grid graph to be edge even graceful graph.