Abstract
A reverse edge magic total (REMT) labeling for the graph Γ = (V(Γ), E(Γ)) along with cardinality of p = |V(G)| and q = |E(G)| respectively. A one-one map π: V(Γ) ∪ E(Γ) → {1, 2, … ,|V(Γ)|+|E(Γ)|} having a rule that for every edge, uv ϵ E(Γ), then π (uv) − {π (u) + π (v)} = c, where c is a magic number. A reverse edge magic total (REMT) labeling is called a reverse super edge magic total (RSEMT) labeling if vertex-set receive natural numbers. In present paper, we compute the RSEMT labeling on the forest of paths and subdivided star.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have