Extended results on sum divisor cordial labeling
DOI:
https://doi.org/10.22199/issn.071762792019040042Keywords:
Divisor cordial labeling, Sum divisor cordial labelingAbstract
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 P n + P n (n is odd), P n @K 1,m , Cn@K 1,m (n is odd), W n * K 1,m (n is even), < K₁¹ ,n,n ∆K₁²2 ,n,n >, < Fl n ¹∆Fl n ² > 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: AddisonWesley, 1972.
G. Ghodasara and M.. Patel, “Some new combination graphs”, International journal of mathematics and its applications, vol. 5, no. 2A, pp. 153161, 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. 1520, 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. 119136, Mar. 2017, doi: 10.4067/S071609172016000100008.
A. Sugumaran and K. Rajesh,”Some new results on sum divisor cordial graphs”, Annals of pure and applied mathematics, vol. 14, no. 1, pp. 4552, 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. 313320, 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. 465472, 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. 802807, Dec. 2017, doi: 10.29055/jcms/721.
A. Sugumaran and K. Rajesh, “Some graph operations on sum divisor cordial labeling related to Hgraph”, International journal of statistics and applied mathematics, vol. 3, no. 1, pp. 389395, 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. 1525, Dec. 2011. [On line]. Available: https://bit.ly/2pjygwK
Published
How to Cite
Issue
Section

Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
 No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.