Abstract
A subtract divisor cordial labeling is bijection r: Z (G+ ) → {1,2,…,|V(G+ )|} in such a way that an edge uv give the label 1 if r(u) - r(v) is divisible by 2 otherwise give the label 0, then absolute difference of number of edges having label 1 and 0 is at most 1. A graph which fulfill the condition of subtract divisor cordial labeling is called subtract divisor cordial graph. In given paper, we found ten new graphs satisfying the condition of subtract divisor cordial labeling. AMS Subject classification number: 05C78
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.