Further results on 3-product cordial labeling.

Authors

Keywords:

Cordial labeling, Product cordial labeling, 3-product cordial labeling, 3-product cordial graph

Abstract

A mapping f : V (G) → {0, 1, 2} is called 3-product cordial labeling if |vf(i) − vf(j)| ≤ 1 and |ef(i) − ef(j)| ≤ 1 for any i, j ∈ {0, 1, 2}, where vf(i) denotes the number of vertices labeled with i, ef(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 K1,n × K2 and permutation graph P (K2 + mK1, I) are 3-product cordial graphs.

Downloads

Download data is not yet available.

Author Biographies

  • P. Jeyanthi, Govindammal Aditanar College for Women.

    Department of Mathematics.

    Research Centre.

  • A. Maheswari, Kamaraj College of Engineering and Technology.

    Department of Mathematics.

  • M. Vijayalakshmi, Dr. G. U. Pope College of Engineering.

    Department of Mathematics.

References

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

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

F. Harary, Graph Theory, Addision Wesley, Massachusetts, (1972).

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

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

P. Jeyanthi and A. Maheswari, 3-product cordial labeling of star graphs, Southeast Asian Bulletin of Mathematics, 39, pp. 429-437, (2015).

P. Jeyanthi and A. Maheswari, Some results on 3-product cordial labeling, Utilitas Mathematica, 99, pp. 215-229, March, (2016).

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

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

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

M. Sundaram, R. Ponraj and S. Somasundaram, EP -cordial labeling of graphs, Varahmihir Journal of Mathematical Sciences, 7(1), pp. 183-194, (2007).

Downloads

Published

2019-05-06

Issue

Section

Artículos

How to Cite

[1]
“Further results on 3-product cordial labeling”., Proyecciones (Antofagasta, On line), vol. 38, no. 2, pp. 191–202, May 2019, Accessed: Sep. 19, 2024. [Online]. Available: https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3523