On Signed Product Cordial Labeling
Jayapal Baskar Babujee, Shobana Loganathan
DOI: 10.4236/am.2011.212216   PDF    HTML     4,299 Downloads   8,065 Views   Citations


A new concept of labeling called the signed product cordial labeling is introduced and investigated for path graph, cycle graphs, star-K1,n, Bistar-Bn,n, and Some general results on signed product cordial labeling are studied.

Share and Cite:

Babujee, J. and Loganathan, S. (2011) On Signed Product Cordial Labeling. Applied Mathematics, 2, 1525-1530. doi: 10.4236/am.2011.212216.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] I. Cahit, “Cordial Graphs: A Weaker Version of Graceful and Harmonious Graphs,” Ars Combinatoria, Vol. 23, 1987, pp. 201-207.
[2] M. Sundaram, R. Ponraj and S. Somasundram, “Total Product Cordial Labeling of Graphs,” Bulletin of Pure and Applied Sciences: Section E. Mathematics and Statistics, Vol. 25, 2006, pp. 199-203.
[3] J. A. Gallian, “A Dynamic Survey of Graph Labeling,” Electronic Journal of Combinatorics, Vol. 17, No. DS6, 2010, pp. 1-246.
[4] S. K. Vaidya, N. A. Dani, K. K. Kanani and P. L. Vihol, “Cordial and 3-Equitable Labeling for Some Star Related Graphs,” International Mathematical Forum, Vol. 4, No. 31, 2009, pp. 1543-1553.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.