• Mini.S.Thomas
• Mathew Varkey T.K

A Graphoidal cover is a partition of edge set of G into internally disjoint paths (not necessarily open). The minimum cardinality of such cover is known as graphoidal covering number of G.Let G=(V,E) be a graph and let ψ be a graphoidal cover of G. A graph G is called magic graphoidal if there exists a minimum graphoidal cover ψ of G such that G admits ψ-magic graphoidal total labeling. In this paper we introduced a new labeling of reverse process of magic graphoidal called reverse-magic graphoidal labeling. In this paper we proved that Path,Star,Comb,[P_n: S_1] are reverse magic graphoidal.

Graphoidal Constant, Graphoidal Cover, Magic Graphoidal, reverse magic graphoidal.

"Reverse-Magic Graphoidal Numbering of a Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 5, page no.668-672, May-2018, Available :http://www.jetir.org/papers/JETIR1805531.pdf

"Reverse-Magic Graphoidal Numbering of a Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 5, page no. pp668-672, May-2018, Available at : http://www.jetir.org/papers/JETIR1805531.pdf