Edge even graceful labeling of cylinder grid graph (Q2337975)

Summary: Edge even graceful labeling (e.e.g., l.) of graphs is a modular technique of edge labeling of graphs, introduced in 2017. An e.e.g., l. of simple finite undirected graph \(G = (V(G), E(G))\) of order \(P = |(V(G) |\) and size \(q = | E(G) |\) is a bijection \(f : E(G) \to \{2, 4, \ldots, 2 q \}\), such that when each vertex \(v \in V(G)\) is assigned the modular sum of the labels (images of \(f\)) of the edges incident to \(v\), the resulting vertex labels are distinct \(\operatorname{mod} 2 r\), where \(r = \max(p, q)\). In this work, the family of cylinder grid graphs are studied. Explicit formulas of e.e.g., l. for all of the cases of each member of this family have been proven.