Further results on 3-product cordial labeling

Jeyanthi, P.; Maheswari, A.; Vijayalakshmi, M.; Jeyanthi, P.; Maheswari, A.; Vijayalakshmi, M.

doi:10.4067/S0716-09172019000200191

Services on Demand

Journal

Article

Automatic translation

Indicators

Cited by SciELO
Access statistics

Proyecciones (Antofagasta)

Print version ISSN 0716-0917

Proyecciones (Antofagasta) vol.38 no.2 Antofagasta June 2019

http://dx.doi.org/10.4067/S0716-09172019000200191

Articles

Further results on 3-product cordial labeling

P. Jeyanthi¹

A. Maheswari²

M. Vijayalakshmi³

^¹Govindammal Aditanar College for Women, Department of Mathematics, Research Centre, Tiruchendur - 628 215, Tamil Nadu, India. e-mail: jeyajeyanthi@rediffmail.com

^²Kamaraj College of Engineering and Technology, Department of Mathematics, Virudhunagar - 626 001, Tamil Nadu, India. e-mail: bala_nithin@yahoo.co.in

^³Dr. G. U. Pope College of Engineering, Department of Mathematics, Sawyerpuram, Thoothukudi District, Tamil Nadu, India. e-mail: viji_mac@rediffmail.com

Abstract

A mapping f : V (G) → {0, 1, 2} is called 3-product cordial labeling if |v_f(i) − v_f(j)| ≤ 1 and |e_f(i) − e_f(j)| ≤ 1 for any i, j ∈ {0, 1, 2}, where v_f(i) denotes the number of vertices labeled with i, e_f(i) denotes the number of edges xy with f(x)f(y) ≡ i(mod 3). A graph with 3-product cordial labeing is called 3-product cordial graph. In this paper we establish that switching of an apex vertex in closed helm, double fan, book graph K_1,n × K₂ and permutation graph P (K₂ + mK₁, I) are 3-product cordial graphs.

Key Words: Cordial labeling; Product cordial labeling; 3-product cordial labeling; 3-product cordial graph.

Texto completo disponible sólo en PDF.

Full text available only in PDF format.

References

[1] I. Cahit, Cordial Graphs: A weaker version of graceful and harmonious graphs, Ars Combinatoria, 23, pp. 201-207, (1987). [ Links ]

[2] Joseph A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, (2018) # DS6. [ Links ]

[3] F. Harary, Graph Theory, Addision Wesley, Massachusetts, (1972). [ Links ]

[4] P. Jeyanthi and A. Maheswari, 3-product cordial labeling of some graphs, International Journal on Mathematical Combinatorics, 1, pp. 96-105, (2012). [ Links ]

[5] P. Jeyanthi and A. Maheswari, 3-product cordial labeling, SUT Journal of Mathematics, 48, pp. 231-240, (2012). [ Links ]

[6] P. Jeyanthi andA. Maheswari , 3-product cordial labeling of star graphs, Southeast Asian Bulletin of Mathematics, 39, pp. 429-437, (2015). [ Links ]

[7] P. Jeyanthi andA. Maheswari , Some results on 3-product cordial labeling, Utilitas Mathematica, 99, pp. 215-229, March, (2016). [ Links ]

[8] P. Jeyanthi , A. Maheswari and M. Vijayalakshmi, 3-Product cordial labeling of some snake graphs, Proyecciones Journal of Mathematics, 38(1), pp. 13-30, March, (2019). [ Links ]

[9] R. Ponraj, M. Sivakumar and M. Sundaram, k-product cordial labeling of graphs, Int. J. Contemp. Math. Sciences, 7, (15), pp. 733-742, (2012). [ Links ]

[10] M. Sundaram , R. Ponraj and S. Somasundaram, Product Cordial labeling of graphs, Bulletin of Pure and Applied Sciences, 23E(1), pp. 155-163, (2004). [ Links ]

[11] M. Sundaram , R. Ponraj andS. Somasundaram, EP -cordial labeling of graphs, Varahmihir Journal of Mathematical Sciences, 7(1), pp. 183-194, (2007). [ Links ]

Received: November 2015; Accepted: November 2018

This is an open-access article distributed under the terms of the Creative Commons Attribution License