@article{Lourdusamy_Patrick_2017, title={Sum divisor cordial graphs}, volume={35}, url={https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1238}, DOI={10.4067/S0716-09172016000100008}, abstractNote={<span style="font-family: verdana; font-size: small; text-align: justify;">A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V (G) to {1, 2, ..., |V (G)|} such that an edge uv is assigned the label 1 if 2 divides f (u) + f (v) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that path, comb, star, complete bipartite, K</span><sub style="font-family: verdana; text-align: justify;">2</sub><span style="font-family: verdana; font-size: small; text-align: justify;">+ mK</span><sub style="font-family: verdana; text-align: justify;">1</sub><span style="font-family: verdana; font-size: small; text-align: justify;">, bistar, jewel, crown, flower, gear, subdivision of the star, K</span><sub style="font-family: verdana; text-align: justify;">1,3</sub><span style="font-family: verdana; font-size: small; text-align: justify;">* K</span><sub style="font-family: verdana; text-align: justify;">1,n</sub><span style="font-family: verdana; font-size: small; text-align: justify;"> and square graph of B</span><sub style="font-family: verdana; text-align: justify;">n,n</sub><span style="font-family: verdana; font-size: small; text-align: justify;"> are sum divisor cordial graphs.</span>}, number={1}, journal={Proyecciones (Antofagasta, On line)}, author={Lourdusamy, A. and Patrick, F.}, year={2017}, month={Mar.}, pages={119-136} }