.svg){kind=logo}
PRIME CORDIAL LABELING FOR SOME PATH, CYCLE AND WHEEL RELATED GRAPHS
Keywords:
graph labeling, cordial labeling, prime cordial labeling.DOI:
https://doi.org/10.17654/0974165822018Abstract
Prime cordial labeling is a variant of cordial labeling. We investigate prime cordial labeling for vertex switching in path, armed crown, web graph and one point union of cycles.
Received: June 25, 2021
Revised: November 21, 2021
Accepted: February 16, 2022
References
A. Sugumaran and K. Suresh, A special class of prime cordial graphs, Internat. J. Pure Appl. Math. 114(6) (2017), 41-48.
A. Sugumaran and P. Vishnu Prakash, Prime cordial labeling for theta graph, Ann. Pure Appl. Math. 14(3) (2017), 379-386.
A. Sugumaran and P. Vishnu Prakash, Some new results of prime cordial labeling, Internat. J. Pure Engin. Math. 5(1) (2017), 9-14.
A. Sugumaran and V. Mohan, Further results on prime cordial labeling, Ann. Pure Appl. Math. 14(3) (2017), 489-496.
A. Sugumaran and V. Mohan, Prime cordial labeling of some graphs related to H-graph, Ann. Pure Appl. Math. 16(1) (2018), 171-176.
G. V. Ghodasara and J. P. Jena, Prime cordial labeling of the graphs related to cycle with one chord, twin chords and triangle, Internat. J. Pure Appl. Math. 89(1) (2013), 79-87.
G. V. Ghodasara and J. P. Jena, Prime cordial labeling of some special graph families, International Journal of Mathematics and Soft Computing 4(2) (2014), 41-48.
I. Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, Ars Combin. 23 (1987), 201-207.
J. A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. 23 (2020), #DS6.
J. Baskar Babujee and L. Shobana, Prime and prime cordial labeling for some special graphs, Int. J. Contemp. Math. Sci. 5(47) (2010), 2347-2356.
J. Clark and D. A. Holton, A First Look at Graph Theory, World Scientific Publishing Co. Pvt. Ltd., 1969.
M. Sundaram, R. Ponraj and S. Somasundaram, Prime cordial labeling of graphs, J. Indian Acad. Math. 27 (2005), 373-390.
M. Sundaram, R. Ponraj and S. Somasundaram, Total product cordial labeling of graphs, Bull. Pure Appl. Sci. (Section E, Math. and Stat.) 25 (2006), 199-203.
S. Babitha and J. Baskar Babujee, Prime cordial labeling on graphs, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering 7(5) (2013), 848-853.
S. K. Vaidya and N. H. Shah, Prime cordial labeling of some graphs, Open J. Discrete Math. 2 (2012), 11-16.
S. K. Vaidya and N. H. Shah, Prime cordial labeling of some wheel related graphs, Malaya J. Mat. 4(1) (2013), 148-156.
S. K. Vaidya and N. H. Shah, Some new families of prime cordial graphs, J. Math. Research 3(4) (2011), 21-30.
S. K. Vaidya and N. H. Shah, Some new results on prime cordial labeling, ISRN Combin. 2014 (2014), Article ID: 607018, 9 pp.
S. K. Vaidya and P. L. Vihol, Prime cordial labeling for cycle related graphs, Internat. J. Open Problems in Comput. Sci. Math. 3(5) (2010), 223-232.
S. K. Vaidya and P. L. Vihol, Prime cordial labeling for some graphs, Modern Applied Science 4(8) (2010), 119-126.
Downloads
Published
Issue
Section
License
Copyright (c) 2022 PUSHPA PUBLISHING HOUSE, PRAYAGRAJ, INDIA
This work is licensed under a Creative Commons Attribution 4.0 International License.
_________________________
Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.
Contact Pushpa Publishing House for more info or permissions.
Journal Impact Factor: 
