Mean Square Cordial Labeling on Star Related Graphs

A Mean Square Cordial Labeling (MSCL) of a Graph G(V, E) with p vertices and q edges is a bijection from V to {0, 1} such that each edge uv is assigned the label $(\lceil (f{(u)}^{2}+f{(v)}^{2})/2\rceil )$ where ⌈x⌉ (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 it is analyzed that some star related graphs like Bistar graph B(k, k), Subdivision of a star graph S(S_k), Coconut tree CT(k, k), Merge graph C_k*S_k,, Graph P_mΘ K_{1, n} and Banana tree BT(k, k) admits mean square cordial labeling.