Sum divisor cordial labeling for star and ladder related graphs
DOI:
https://doi.org/10.4067/S0716-09172016000400006Keywords:
Divisor cordial, sum divisor cordial, divisor cordial de sumasAbstract
A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V 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; and 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 D2(K1,n), S' (K1,n), D2(Bn,n), DS(Bn,n), S' (Bn,n), S(Bn,n), < K(1)1,nΔK(2)1,n>, S(Ln), Ln O K1, SLn, TLn, TLn O Ki and CHn are sum divisor cordial graphs.References
[1] J. A. Gallian, A Dyamic Survey of Graph Labeling, The Electronic J. Combin., 18 (2015) # DS6.
[2] F. Harary, Graph Theory, Addison-wesley, Reading, Mass, (1972).
[3] A. Lourdusamy and F. Patrick, Sum Divisor Cordial Graphs, Proyecciones Journal of Mathematics, 35(1), pp. 115-132, (2016).
[4] A. Lourdusamy and F. Patrick, Sum Divisor Cordial Labeling for Path and Cycle Related Graphs (submitted for publication)
[5] S. S. Sandhya, S. Somasundaram and S. Anusa Some New Results on Root Square Mean Labeling, International Journal of Mathematical Archive, 5(12), pp. 130-135, (2014).
[6] M. Seenivasan Some New Labeling Concepts, PhD thesis, Manonmaniam Sundaranar University, India, (2013).
[7] S. K. Vaidya and C. M. Barasara, Product Cordial Graphs in the Context of Some Graph Operations, International Journal of Mathematics and Scientific Computing, 1(2), pp. 122-130, (2011).
[8] S. K. Vaidya and N. H. Shah, Some Star and Bistar Related Cordial Graphs, Annals of Pure and Applied Mathematics, 3(1), pp. 67-77, (2013).
[9] S. K. Vaidya and N. J. Kothari, Line Gracefulness of Some Path Related Graphs, International Journal of Mathematics and Scientific Computing, 4(1), pp. 15-18, (2014)
[2] F. Harary, Graph Theory, Addison-wesley, Reading, Mass, (1972).
[3] A. Lourdusamy and F. Patrick, Sum Divisor Cordial Graphs, Proyecciones Journal of Mathematics, 35(1), pp. 115-132, (2016).
[4] A. Lourdusamy and F. Patrick, Sum Divisor Cordial Labeling for Path and Cycle Related Graphs (submitted for publication)
[5] S. S. Sandhya, S. Somasundaram and S. Anusa Some New Results on Root Square Mean Labeling, International Journal of Mathematical Archive, 5(12), pp. 130-135, (2014).
[6] M. Seenivasan Some New Labeling Concepts, PhD thesis, Manonmaniam Sundaranar University, India, (2013).
[7] S. K. Vaidya and C. M. Barasara, Product Cordial Graphs in the Context of Some Graph Operations, International Journal of Mathematics and Scientific Computing, 1(2), pp. 122-130, (2011).
[8] S. K. Vaidya and N. H. Shah, Some Star and Bistar Related Cordial Graphs, Annals of Pure and Applied Mathematics, 3(1), pp. 67-77, (2013).
[9] S. K. Vaidya and N. J. Kothari, Line Gracefulness of Some Path Related Graphs, International Journal of Mathematics and Scientific Computing, 4(1), pp. 15-18, (2014)
Published
2017-03-23
How to Cite
[1]
A. Lourdusamy and F. Patrick, “Sum divisor cordial labeling for star and ladder related graphs”, Proyecciones (Antofagasta, On line), vol. 35, no. 4, pp. 437-455, Mar. 2017.
Issue
Section
Artículos
-
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.