Volume 54 | Number 4 | Year 2018 | Article Id. IJMTT-V54P537 | DOI : https://doi.org/10.14445/22315373/IJMTT-V54P537
In this paper, we prove the existence of 3-total cordial vertex-magic labeling and 3-total cordial edge-magic labeling for the extended triplicate graph of a ladder graph by presenting algorithms.
[1] E. Bala., K. Thirusangu.K, Some graph labelings in extended triplicate graph of a path Pn, International Review of Applied Engineering Research, Vol. 1, No.1(2011),81-92.
[2] S. Bala, K. Thirusangu, A. Selvaganapathy, Total cordial magicness in triplication of graphs, International Journal of Advanced Scientific Research and Development, Vol.4, No.2 (2017), 70-77.
[3] I. Cahit, Cordial graphs; a weaker version of graceful and harmonious graphs, ArsCombin, 23(1987), 201-207.
[4] J.A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics ,18 (2011), #DS6.
[5] S. Gurupriya, S. Bala, Cordial labeling in the context of triplication, International Research Journal of Engineering and Technology, Vol.4,No.7,(2017), 2303-2306.
[6] A. Kotzig and A. Rosa, Magic valuations of finite graphs, Canad. Math. Bull., 13 (1970) 451-461.
[7] J.A. MacDougall, M. Miller , Slamin, and W.D. Wallis, Vertex-magic total labelings of graphs, Util. Math., 61 (2002) 3-21.
[8] G. Ringel and A. Llado, Another tree conjecture, Bull.Inst.Combin. Appl., 18(1996)83-85.
[9] A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs (Internat.Symposium, Rome, July 1996), Gordon and Breach, N.Y. and Dunod Paris (1967), 349-355.
[10] K. Thirusangu, P.P. Ulaganathan. and P. Vijayakumar, Some Cordial Labeling of Duplicate Graph of Ladder Graph, Annals of Pure and Applied Mathematics, Vol. 8, No. 2, (2014), 43-50.
S. Bala, S. Gurupriya, "Some Graph Labelings in Triplication," International Journal of Mathematics Trends and Technology (IJMTT), vol. 54, no. 4, pp. 325-331, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V54P537