Abstract
A bijective map ρ from V(Ω) →{1,2, … |V(Ω)|} is called sum divisor cordial labeling for graph Ω so that for every uυ ∈ E(Ω) edge is fixed the label 1 if 2 divides ρ (u) + ρ(υ) and 0 otherwise, then the difference between number of edges labeled with 1 and the number of edges labeled with 0 by at most 1. A graph is called sum divisor cordial graph if it admits sum divisor cordial labeling. In present article, we investigate the disconnected graph such as the disjoint union of paths and subdivided star are sum 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: Journal of Discrete Mathematical Sciences and Cryptography
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.