On Variation of Product Cordial Labeling of Subdivision of Flower and Its Path Union
Sharon Philomena. V1 , Priyadharshini. T2
Section:Research Paper, Product Type: Journal Paper
Volume-07 ,
Issue-05 , Page no. 64-68, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7si5.6468
Online published on Mar 10, 2019
Copyright © Sharon Philomena. V, Priyadharshini. T . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
View this paper at Google Scholar | DPI Digital Library
How to Cite this Paper
- IEEE Citation
- MLA Citation
- APA Citation
- BibTex Citation
- RIS Citation
IEEE Citation
IEEE Style Citation: Sharon Philomena. V, Priyadharshini. T, “On Variation of Product Cordial Labeling of Subdivision of Flower and Its Path Union,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.05, pp.64-68, 2019.
MLA Citation
MLA Style Citation: Sharon Philomena. V, Priyadharshini. T "On Variation of Product Cordial Labeling of Subdivision of Flower and Its Path Union." International Journal of Computer Sciences and Engineering 07.05 (2019): 64-68.
APA Citation
APA Style Citation: Sharon Philomena. V, Priyadharshini. T, (2019). On Variation of Product Cordial Labeling of Subdivision of Flower and Its Path Union. International Journal of Computer Sciences and Engineering, 07(05), 64-68.
BibTex Citation
BibTex Style Citation:
@article{V_2019,
author = {Sharon Philomena. V, Priyadharshini. T},
title = {On Variation of Product Cordial Labeling of Subdivision of Flower and Its Path Union},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {07},
Issue = {05},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {64-68},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=806},
doi = {https://doi.org/10.26438/ijcse/v7i5.6468}
publisher = {IJCSE, Indore, INDIA},
}
RIS Citation
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i5.6468}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=806
TI - On Variation of Product Cordial Labeling of Subdivision of Flower and Its Path Union
T2 - International Journal of Computer Sciences and Engineering
AU - Sharon Philomena. V, Priyadharshini. T
PY - 2019
DA - 2019/03/10
PB - IJCSE, Indore, INDIA
SP - 64-68
IS - 05
VL - 07
SN - 2347-2693
ER -




Abstract
In this paper, we prove that the subdivision of Flower graph and the Path union of k 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.
Key-Words / Index Term
Product cordial labeling, Total product cordial labeling, Flower graph, Subdivision, Path union
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).