Reverse vertex magic labeling of complete graphs Md. Shakeel1, Basha Shaik Sharief2, Sarmasmieee K.J3 1Research Scholar [PT], JNTUH, Hyderabad-500085, Telangana, India 2VIT University, Vellore-632014, Tamilnadu, India 3Siddhartha Institute of Technology & Sciences, Hyderabad *Corresponding Author E-mail: shakeel1775@gmail.com, shariefbasha.s@vit.ac.in, jskalavendi@gmail.com
Online published on 2 March, 2017. Abstract A reverse vertex magic labeling of a graph G = (V, E) is a bijection  such that for every vertex v,  is a constant. It is well known that all complete graphs Kn admit a reverse magic labeling. In this paper, we present a new proof of this theorem using the concepts of twin factorization and magic square. Top Keywords Complete graphs, reverse vertex magic labeling factorization. Top |