DOI: 10.5176/2251-1911_CMCGS17.31

Authors: mukund bapat

Abstract: In this paper we study product cordiality of some families of graph .We show that,fusion graph C3FCn ,snakes on any length of cycle Cn i.e. S(Cn,n) ,one point union of k copies of flag graph FL(C3)k and fusion graph K4FCn are product cordial graphs

Keywords: labelling, cycle,path,edge,product cordial.

Price: $4.99

Loading Updating cart...
LoadingUpdating...