Open AccessALGORITHMS FOR CONSTRUCTING EDGE MAGIC TOTAL LABELING OF COMPLETE BIPARTITE GRAPHS
Author(s) -
Krishnappa H. K,
N. K. Srinath,
S. Manjunath,
Ramakanth Kumar P
Publication year - 2015
Publication title -
international journal of computer and communication technology
Language(s) - English
Resource type - Journals
eISSN - 2231-0371
pISSN - 0975-7449
DOI - 10.47893/ijcct.2015.1274
Subject(s) - combinatorics , bipartite graph , magic (telescope) , edge graceful labeling , mathematics , graph labeling , complete bipartite graph , discrete mathematics , graph , graph power , line graph , physics , quantum mechanics
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.