Product Cordial Labeling for Some New Graphs

S K Vaidya, C M Barasara


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.

Full Text:



Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the '' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.