Abstract
A divisor cordial labeling of graph G with vertex set V is bijection from V to {1,2,……..V(G)} such that if each edge uv is assigned the label 1 if f(u)/ f(v) or f(v)/f(u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. A graph which admits divisor cordial labeling is the divisor cordial graph. In this paper, it is proved that Shell(Fn),Umberlla( U(n,3) ),Wheel(Wn ),Globe(Gl(n) )are divisor cordial graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Mathematical Trends and Technology
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.