Total Magic Cordial Labeling of Complete Multipartite Graphs

Let G=(V,E) be a graph. A mapping f from V(G)∪E(G) to {0,1} is called Total magic cordial (TMC) labeling if for every ab∈E(G), is a constant and |vf(0)−vf(1)|≤1, where vf(i) denotes the number of vertices and edges labeled with i, i∈Z2. A graph which admits TMC labeling is called Total Magic Cordial Graph. In this paper, we show that the complete tripartite graphs are TMC. Further we show that complete multipartite graphs are TMC, when the partite sets are of even sizes.