Odd Factor Decomposition of E-Super Magic Graphs

An F-magic labeling in an F-decomposable graph G of order p and size q is a bijection f :V (G)∪ E(G)→{1,2....p + q} such that for every copy F in the decomposition, Σ_VeV(F)f(v) + Σ_e∈E(F)f(e) is constant. The function f is said to be F-E super magic if f (E(G)) = {1,2,....q}. This article contains, a necessary and some sufficient conditions for some even regular and odd regular graphs G to have an (2k +1) - factor E-super magic decomposition, for k ≥1.