Mean Square Difference Cordial Labeling of Path Related Graphs

Abstract

Mean Square Difference Cordial Labeling of a graph G with vertex set V is a bijection from V(G) to {1, 2, ……,|V(G)| } such that an edge uv is assigned 0, if ⌊|〖[f(u)]〗^2-〖[f(v)]〗^2 |/2⌋ is even and an edge uv is assigned 1, if ⌊|〖[f(u)]〗^2-〖[f(v)]〗^2 |/2⌋ is odd then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a mean square difference cordial labeling is called a Mean Square Difference Cordial graph. This paper elucidates Mean Square Difference Cordial Labeling of Centipede, Total graph of path, Quadrilatornal Snake, Hurdle, ladder and P_n⨀A(k_1) graphs.