Abstract
We prove that path union of finite copies of helm, closed helm, gear graph are product cordial graphs. Further we prove that the graph obtained by joining two copies of helm by a path of arbitrary length is product cordial graph. We prove similar results for closed helm and gear graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Pure and Apllied Mathematics
Paper Title
Journal
Date
