CORDIALITY IN THE PATH UNION OF VERTEX SWITCHING OF CYCLES IN INCREASING ORDER

The Cordial labeling of a graph G is a function f : V (G)→ {0,1} such that each edge uv in G is assigned the label |f(u)-f(v)| with the property |vf (0) - vf (1)|≤ 1 and |e_f*(0)-e_f*(1)|≤1, where v_f (i) for i = 0, 1 denote the number of vertices with label i and e_f*(i) for i = 0, 1 denote the number of edges with label i. The graph which admits cordial labeling is called the Cordial graph. In this paper, we prove that the path union of vertex switching of cycles in increasing order is cordial.