EDGE PRODUCT CORDIAL LABELING OF SWITCHING OPERATION ON SOME GRAPHS

Here we discuss and prove that the graphs attained by switching of any vertex with degree two which is adjacent to a vertex with degree two in triangular snake [T.sub.m], switching of any vertex with degree one in path [P.sub.m] for m [greater than or equal to] 3 and m odd, Switching of vertex with degree two in [P.sub.m] except vertices [u.sub.2] or [u.sub.m-1] with m > 4 and switching of any vertex in cycle [C.sub.m] are an edge product cordial graphs. Keywords: Graph labeling, Product cordial labeling, Switching Operation, Edge Product Cordial Labeling. AMS Subject Classification: 05C78.