On Variation of Product Cordial Labeling of Subdivision of Flower and Its Path Union
Keywords:
Product cordial labeling, Total product cordial labeling, Flower graph, Subdivision, Path unionAbstract
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
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
