On Reverse Super Vertex-Magic Labeling

For a graph G(V, E) an injective mapping f from to the set is a reverse vertex-magic labeling if there is a constant h so that for every vertex where the difference runs over all vertices u adjacent to v . A vertex-magic labeling f is called super vertex-magic labeling if and . A graph G is called a reverse super vertex-magic if there exists a reverse super vertex-magic labeling of G. In this paper, we established some properties of reverse super vertex magic trees and exhibit reverse super vertex-magic labeling of a kite graph.