# Extended results on sum divisor cordial labeling

### Abstract

A sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge uv assigned the label 1 if 2 divides f(u)+f(v) and 0 otherwise. Further the number of edges labeled with 0 and the the number of edges labeled with 1 differ by atmost 1. A graph with sum divisor cordial labeling is called a sum divisor cordial graph. In this paper we prove that the graphs Pn + Pn (n is odd), Pn@K1,m, Cn@K1,m (n is odd), Wn ∗ K1,m (n is even), < K₁¹,n,n ∆K₁²,n,n >, < Fln¹∆Fln² > are sum divisor cordial graphs.### References

J. Gallian, “A Dynamic Survey of Graph Labeling”, 20th ed. The electronics journal of combinatorics, vol. # DS6, p. 432, 2007. [On line]. Available: http://bit.ly/33bdu1B

F. Harary, Graph theory. Reading, MA: Addison-Wesley, 1972.

G. Ghodasara and M.. Patel, “Some new combination graphs”, International journal of mathematics and its applications, vol. 5, no. 2-A, pp. 153-161, 2017. [On line]. Available: https://bit.ly/2nCU8CS

V. Kaneria and H. Makadia, “Graceful labeling for plus graph”, International journal of current research in science and technology, vol.1, no. 3, pp. 15-20, 2015. [On line]. Available: https://bit.ly/2pjtOhu

A. Lourdusamy and F. Patrick, “Sum divisor cordial graphs”, Proyecciones (Antofagasta, On line), vol. 35, no. 1, pp. 119-136, Mar. 2017, doi: 10.4067/S0716-09172016000100008.

A. Sugumaran and K. Rajesh,”Some new results on sum divisor cordial graphs”, Annals of pure and applied mathematics, vol. 14, no. 1, pp. 45-52, Jul. 2017, doi: 10.22457/apam.v14n1a6.

A. Sugumaran and K. Rajesh, “Sum divisor cordial labeling of Theta graph”, Annals of pure and applied mathematics, vol. 14, no. 2, pp. 313-320, Sep. 2017, doi: 10.22457/apam.v14n2a14.

A. Sugumaran and K. Rajesh, “Sum divisor cordial labeling of Herschel graph”, Annals of pure and applied mathematics, vol. 14, no.3, pp. 465-472, Oct. 2017, doi: 10.22457/apam.v14n3a14.

A. Sugumaran and K. Rajesh, “Further results on sum divisor cordial labeling”, Journal of computer and mathematical sciences, vol. 8, no. 12, pp. 802-807, Dec. 2017, doi: 10.29055/jcms/721.

A. Sugumaran and K. Rajesh, “Some graph operations on sum divisor cordial labeling related to H-graph”, International journal of statistics and applied mathematics, vol. 3, no. 1, pp. 389-395, 2018. [On line]. Available: https://bit.ly/2orKq6k

R. Varatharajan, S. Navaneethakrishnan and K. Nagarajan, “Divisor cordial graph”, International journal of mathematical combinatorics, vol. 4, pp. 15-25, Dec. 2011. [On line]. Available: https://bit.ly/2pjygwK

*Proyecciones (Antofagasta, On line)*, vol. 38, no. 4, pp. 653-663, Oct. 2019.

Copyright (c) 2019 A. Sugumaran, K. Rajesh

This work is licensed under a Creative Commons Attribution 4.0 International License.