Signed Product Cordial and Even Sum Cordial Labeling for the Extended Duplicate Graph of Splitting Graph of Path
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Graph labeling, Duplicate graph, Splitting graph, Signed product cordial, Even sum cordialAbstract
In this paper, we prove that the extended duplicate graph of splitting graph of path admits signed product cordial, total signed product cordial and even sum cordial labeling.
Downloads
Published
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.