• k – SUM CORDIAL LABELING FOR SOME GRAPHS

Abstract

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,…, k-1} where k is an integer, 1 £ k £ ½V (G) ½.  For each edge uv, assign the label (f(u) + f(v)) (mod k). The map f  is called a k-sum cordial labeling, if   and ,  for and i, j Î{0, 1,…,k-1} where and denote the number of vertices and edges respectively  labeled with ( = 0, 1, 2,…, k-1).  Any graph which satisfies k-sum cordial labeling is called a k-sum cordial graph.  Here we prove some graphs like Star and Bistar are k-sum cordial graphs.  Also we investigate any path is a odd sum cordial graph, any cycle (n ³ 3) and double star are 3-sum cordial graphs.