6 citations · 12 across the 3 of their papers we have counts for
3 papers
cs.DM2011
An Algorithm for Odd Gracefulness of the Tensor Product of Two Line Graphs
M. Ibrahim Moussa
An odd graceful labeling of a graph G=(V,E) is a function f:V(G)->[0,1,2,...,2|E(G)|-1} such that |f(u)-f(v)| is odd value less than or equal to 2|E(G)-1| for any u, v in V(G). In…
cs.IT2010★ 6 cited
An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles
M. Ibrahim Moussa
In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1 edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd graceful if and only if…
cs.NI2010★ 6 cited
An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles
M. Ibrahim Moussa
In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1 edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd graceful if and only if…