Reverse Super Edge Magic Strength of Some Graphs

Authors

Kotte Amaranadha Reddy, Research Scholar, S Sharief Basha, Assistant Professor (Sr.)
Department of Mathematics, VIT, Vellore.

Abstract

If ∃ a bijection f from V∪E→{1,2,3,…,|V|+|E|} as well as f(e)-{f(u)+f(v)}=k is constant for all e∈E and f(V)={1,2,3,…,|V|}, Reverse super edge magic (RSEM) is a graph G(V,E). The smallest of all k, where the minimum is indicated by rsm(G), and it runs through all RSEM labelings of G, is the graph G’s RSEM strength. The RSEM strength of some graph families can be found here.