• 3-TOTAL SUPER SUM CORDIAL LABELING FOR SOME GRAPHS

Abstract

In this paper we investigate a new labeling called 3-total super sum cordial labeling. Suppose G =(V (G),E(G))be a graph with vertex set V (G) and edge set E(G).A vertex labeling f : V (G) →{0, 1, 2}: For each edge uv assign the label (f(u) +f(v)) (mod3). The map f is called a 3-total super sum cordial labeling if │f(i)-f(j)│≤ 1, for i ,j Є {0,1,2} where f(x) denotes the total number of vertices and edges labeled with x={0,1,2}  and for each edge uv, │f(u)-f(v)│≤ 1. Any graph which satisfies 3-total super sum cordial labeling is called a 3-total super sum cordial graphs. Here we prove some graphs like path, cycle and complete bipartite graph K_{1, n} are 3-total super sum cordial graphs.