Research Journal of Pharmacy and TechnologyYear : 2016, Volume : 9, Issue : 10
First page :
Last page :
ISSN : 0974-3618.
ISSN : 0974-360X.
Article DOI :
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: firstname.lastname@example.org, email@example.com, firstname.lastname@example.org
Online published on 2 March, 2017.
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.
Complete graphs, reverse vertex magic labeling factorization.