Product Cordial Labeling for Some New Graphs
Samir K. VAIDYA, Chirag M. BARASARA · Journal of Mathematics Research · 2011
In this paper we investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at diameter distance) are product cordial graphs. We also investigated middle graph of path $P_{n}$ admits product cordial labeling.