Cordial Labeling In Some Special Graphs

Document Type : Primary Research paper


1 Department of Mathematics, Bannari Amman Institute of Technology, Erode, Tamilnadu, India.

2 Department of Science and Humanities, Sri Krishna College of Engineering and Technology, Coimbatore, Tamilnadu,India.

3 Department of Mathematics,M.Kumarasamy college of Engineering, Karur, Tamilnadu, India


A bijection f :V(G)0,1is called binary vertex labeling of G(V,E) and f (v)
is called the label of the vertex vG under f .For an edge e  uv , the induced edge
labeling f *: E(G)0,1 is given by f *(e)  f (u)  f (v) . Let (0), (1) f f v v be the number
of vertices of G having labels 0 and 1 respectively under f and (0), (1) f f e e be the number of
edges having labels 0 and 1 respectively under f * .A graph G(V,E) is cordial if it admits
cordial labelling.In this paper, we investigate the cordiallabeling for some special graphs
like Golomb graph,Wagner graph, Herschel graph, Petersen graph,etc. .