International Journal of Mathematics Trends and Technology
Volume 40 | Number 2 | Year 2016 | Article Id. IJMTT-V40P519 | DOI : https://doi.org/10.14445/22315373/IJMTT-V40P519
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 investigate the sum divisor cordial labeling of switching of a pendent vertex in path Pn, switching of any vertex in cycle Cn, DS(Bn,n), G*K2,n and G*K3,n.
[1] I. Cahit, “Cordial graphs: A weaker version of graceful and harmonious graphs”, Ars Combinatoria, Vol 23, 1987, pp. 201-207.
[2] G. Chartrand and L. Lesniak, Graphs and Digraphs, third edition, Chapman and Hall / CRC, Florida 2000.
[3] David M. Burton, Elementary Number Theory, Second Edition, Wm. C. Brown Company Publishers, 1980.
[4] J. A. Gallian, “A dynamic survey of graph labeling”, The Electronic Journal of Combinatorics, 16, # DS6, 2015.
[5] A. Lourdusamy and F. Patrick, “Sum divisor cordial graphs”, Proyecciones Journal of Mathematics, Vol. 35, No 1, 2016, pp. 119-136.
[6] R. Varatharajan, S. Navanaeethakrishnan and K. Nagarajan, “Divisor cordial graphs”, International J. Math. Combin., Vol 4, 2011, pp. 15-25.
P. Lawrence Rozario Raj, S. Hema Surya, "Some New Families of Sum Divisor Cordial Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 40, no. 2, pp. 175-179, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V40P519
PDF 
Abstract 
Keywords 
References 
Citation