Product Cordial Labeling of Double wheel and Double fan Related Graphs

A. H. Rokad1

I prove that Double wheel, path union of finite copies of Double wheel are product cordial graphs. Further I prove that the graph obtained by joining two copies of double wheel by a path of arbitrary length is product cordial graph. I also prove that $DW_{n} \oplus K_{1,n}$ and $DF_{n} \oplus K_{1,n}$ are product cordial graphs.