Mean Square Cordial Labeling Of Some Pentagonal Snake Graphs

The A Mean Square Cordial labeling of a Graph G(V,E) with p vertices and q edges is an onto from V to {0, 1} such that each edge uv is assigned the label where (ceil( x)) is the least integer greater than or equal to x with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges labeled 0 and the number of edges labeled with 1 differ by at most 1.In this paper we analysed that Pentagonal snake PSk, Subdivision of a pentagonal snake S(PSk ) ,Double pentagonal snake D(PSk) and Alternate pentagonal snake A(PSk) are mean square cordial graphs.