Edge-odd graceful labelings of prism-like graphs of cycles
Apinya Tirasuwanwasee, Ratinan Boonklurb, Kitiporn Plaimas · 2015
A simple graph G with q edges is called an edge-odd graceful graph, if there is a bijection f from the edge set of the graph to {1,3,5,…,2q-1} such that, when each vertex is assigned the sum of all values of the edges incident to it modulo 2q, the resulting vertex labels are distinct. In this thesis, we define new prism-like graphs and prove that they are edge-odd graceful graphs.