A (p, q)-graph G is reverse super magic if there exists a bijection f: V ∪ E → {1,2, ..., p + q} such that f(u) + f(v)-f(uv) = e~(-1) _f is a constant for any edge uv ∈ E and f (E) = {1,2,..., q}. Then f is a reverse super magic labeling of G. The reverse super magic strength of a reverse super magic graph G is defined as rsms(G) = min {c~(-1) _f: f is a reverse super magic labeling of G}. In this paper, a characterization of a triangle free reverse super magic graph to attain the lower bound of the reverse super magic strength has been obtained. Moreover, the reverse super magic strength of some new classes of graphs such as < K_(1,m): P_n >, B_(m,n) < K_(1,m): K_(1,n) >, C_n ⊙ K_2 K(n)~+ _3 and has been computed.
展开▼
