Mean Cordial Labeling Patterns In Shadow- Graphs Of Paths

Let f be a function from V (G) to {0,1,2}. Give a numerical value (label) from {0, 1, 2} for every edge uv. f is called a mean cordial labeling if |v_f (i)-v_f (j)|≤1 and |e_f (i)-e_f (j)|≤1, ∀ i,j ∈ {0,1,2} where v_f (x) and e_f (x) represent the number of vertices and edges respectively labeled as x(x = 0,1,2). A graph with mean cordial labeling is called a mean cordial graph. In this paper, we study the mean cordial labeling pattern of shadow-graphs of path graphs D_2 (P_n ), for n≥2