Edge even graceful labeling of some graphs
Mohamed R. Zeen El Deen · Journal of the Egyptian Mathematical Society · 2019
Edge even graceful labeling is a new type of labeling since it was introduced in 2017 by Elsonbaty and Daoud (Ars Combinatoria 130:79–96, 2017). In this paper, we obtained an edge even graceful labeling for some path-related graphs like Y- tree, the double star Bn,m, the graph 〈K1,2n:K1,2m〉, the graph $ ~P_{2n-1}\odot \overline { K_{2m}}~ $ , and double fan graph F2,n. Also, we showed that some cycle-related graphs like the prism graph $ ~\prod _{n}~ $ , the graph $ ~C_{n}\left (\frac {n}{2}\right)~ $ , the flag FLn, the graph K2⊙Cn, the flower graph FL(n), and the double cycle {Cn,n} are edge even graphs.