EDGE PRODUCT CORDIAL LABELING OF SWITCHING OPERATION ON SOME GRAPHS

EDGE PRODUCT CORDIAL LABELING OF SWITCHING OPERATION ON SOME GRAPHS

U. M. Prajapati, N. B. Patel

[PDF]

Abstract

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 Tm, switching of any vertex with degree one in path Pm for m  3 and m odd, Switching of vertex with degree two in Pm except vertices u2 or um????1 with m > 4 and switching of any vertex in cycle Cm are an edge product cordial graphs.

Keywords

Graph labeling, Product cordial labeling, Switching Operation, Edge Prod- uct Cordial Labeling.