On Variation of Product Cordial Labeling of Subdivision of Flower and Its Path Union

Authors

  • Philomena VS P.G. Department of Mathematics, Women’s Christian College, Chennai, India
  • Priyadharshini T P.G. Department of Mathematics, Women’s Christian College, Chennai, India

Keywords:

Product cordial labeling, Total product cordial labeling, Flower graph, Subdivision, Path union

Abstract

In this paper, we prove that the subdivision of Flower graph and the Path union of copies of subdivision of Flower graphs are Product cordial graph and Total product cordial graphs. We also extend to prove that the path union from the outer vertex of the subdivision of Flower admits Product cordial and total product cordial labeling

References

[1] I.Cahit, Cordial graphs, A weaker version of graceful and harmonious graphs,ArsCombinatoria, Vol.23(1987), pp.201-207.

[2] Gallian J. A., A dynamical survey of graph labeling, Electronics Journal of Combinatorics,17th Ed.,(2017).

[3] Rosa.A, Theory of Graphs, Gordon and Breach, (1967).

[4] M. Sundaram, R. Ponraj and S.Somasundaram,(2004) Product cordial labeling of graphs,Bull. Pure and Appl. Sci. (Math. & Stat.), Vol. 23E pp.155-163

[5] M. Sundaram, R. Ponraj, and S. Somasundram, (2006) Total product cordial labeling of graphs, Bull.Pure Appl. Sci. Sect. E Math. Stat., Vol.25 pp.199-203.

[6] S. K. Vaidya and C. M. Barasara,(2011) Product cordial graphs in the context of some graph operations, Internal. J. Math. Sci. Comput., Vol.1(2).

Downloads

Published

2025-11-25

How to Cite

[1]
S. V. Philomena and T. Priyadharshini, “On Variation of Product Cordial Labeling of Subdivision of Flower and Its Path Union”, Int. J. Comp. Sci. Eng., vol. 7, no. 5, pp. 64–68, Nov. 2025.