International Journal of Computer and Communication Technology
Abstract
The study of graph labeling has focused on finding classes of graphs which admits a particular type of labeling. In this paper we consider a particular class of graphs which demonstrates Edge Magic Total Labeling. The class we considered here is a complete bipartite graph Km,n. There are various graph labeling techniques that generalize the idea of a magic square has been proposed earlier. The definition of a magic labeling on a graph with v vertices and e edges is a one to one map taking the vertices and edges onto the integers 1,2,3,………, v+e with the property that the sum of the label on an edge and the labels of its endpoints is constant independent of the choice of edge. We use m x n matrix to construct edge magic total labeling of Km,n.
Recommended Citation
K, KRISHNAPPA H.; SRINATH, N K.; Manjunath, S.; and P, RAMAKANTH KUMAR
(2015)
"ALGORITHMS FOR CONSTRUCTING EDGE MAGIC TOTAL LABELING OF COMPLETE BIPARTITE GRAPHS,"
International Journal of Computer and Communication Technology: Vol. 6:
Iss.
1, Article 12.
DOI: 10.47893/IJCCT.2015.1274
Available at:
https://www.interscience.in/ijcct/vol6/iss1/12
DOI
10.47893/IJCCT.2015.1274
