Cordial Labeling on Few Graphs of Subdividedshell Graphs

Abstract

In 1987, Cahit[1]implemented cordial labeling. Cordial labeling[1] is defined as a function in which each edge  is assigned the label  with the conditions  and 1 where  and signify the number of vertices with 0’s and 1’s, similarly signify  the number of edges with 0’s and 1’s.   We want to show that the graphssuch as uniform sub-divided shell bow graph, uniform sub-divided shell flower graph, one point union of multiple sub-divided shell graph, sub-divided shell Graph with star graphs coupled to the apex and path vertices are cordial.