Edge even graceful labeling of polar grid graphs (Q2333967): Difference between revisions

Summary: Edge Even Graceful Labelingwas first defined by \textit{A. Elsonbaty} and the second author [Ars Comb. 130, 79--96 (2017; Zbl 1413.05325)]. 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, \dots, 2 q \}\) such that, when each vertex is assigned the sum of all edges incident to it \(\bmod{ 2r}\) 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.