• U.Masthan Raju
• Dr.Shaik.Sharief Basha

A Reverse vertex-magic total labeling of a graph with vertices and edges is defined as a one-to-one map taking the vertices and edges onto the integers 1,2,…, with the property that the subtract of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex. Properties of these labelings are studied. It is shown how to construct labelings for several families of graphs, including cycles, paths, complete graphs of odd order and the complete bipartite graph . It is also shown that labelings are impossible for some other classes of graphs.

Vertex-magic Labeling, Regular Graphs, paths, cycles

"REVERSE VERTEX-MAGIC LABELINGS OF GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 12, page no.57-61, December-2018, Available :http://www.jetir.org/papers/JETIR1812611.pdf

"REVERSE VERTEX-MAGIC LABELINGS OF GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 12, page no. pp57-61, December-2018, Available at : http://www.jetir.org/papers/JETIR1812611.pdf