Total Cordial Labeling of Special Classes of Snake Graphs

Abstract

A graph G is said to be cordial if there exist a vertex labeling
 which induces an edge labeling  defined by
 for each edge , such that  and  where  is the number of vertices labeled with 0,  is the number of vertices labeled with 1,  is the number of edges labeled with 0 and  is the number of edges labeled with 1. A cordial graph in which the number of vertices and edges labeled with 0 and the number of vertices and edges labeled with 1 differ by at most 1(i.e)  is called as a total cordialgraph.  In this paper, we have proved the existence of total cordial labeling of special classes of snake graphs.