Research ArticleOpen AccessGoogle Scholar indexed
On Signed Product Cordial Labeling
- 1
- 2
Applied Mathematics·Volume 02 (2011)·Pages 1525–1530·Published 5 December 2011·DOI10.4236/am.2011.212216
Copy link · social · email
Abstract
A new concept of labeling called the signed product cordial labeling is introduced and investigated for path graph, cycle graphs, star-K<sub>1,n</sub>, Bistar-B<sub>n,n</sub>, and Some general results on signed product cordial labeling are studied.
KeywordsGraphLabelingFunctionCordial Labeling
- I. Cahit, “Cordial Graphs: A Weaker Version of Graceful and Harmonious Graphs,” Ars Combinatoria, Vol. 23, 1987, pp. 201-207.
- 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.
- J. A. Gallian, “A Dynamic Survey of Graph Labeling,” Electronic Journal of Combinatorics, Vol. 17, No. DS6, 2010, pp. 1-246.
- 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.