Acknowledgement
The author would like to thank the anonymous referee who provided useful and detailed comments on a previous version of the manuscript.
References
- I. Cahit, Cordial graphs-a weaker version of graceful and harmonious graphs, Ars combinatoria 23 (1987), 201-207.
- A. Lourdusamy, S. Jenifer Wency & F. Patrick, Group S3 cordial remainder labeling, International Journal of Recent Technology and Engineering 8 (2019), 8276-8281.
- A. Lourdusamy, E. Veronisha, Some Results On Group S3 Mean Cordial Labeling, Recent Trends in Modern Mathematics (Conference Proceeding), St. John's College(Autonomous), Palayamkottai ISBN: 978-93-5566-257-6, 1 (2021), 335-340.
- A. Lourdusamy, E. Veronisha, Group S3 Mean Cordial Labeling for ladder and snake related graphs, Sciencia Acta Xaveriana 12 (2021), 57-65.
- R. Ponraj, M. Sivakumar & M. Sundaram, Mean cordial labeling of graphs', Open Journal of Discrete Mathematics, 12 (2012), 145-148.
- Rosa, Alexander, On certain valuations of the vertices of a graph, Theory of Graphs, Internat. Symposium, Rome, July 1966.
- West, Douglas Brent, Introduction to graph theory, Vol. 2, Upper Saddle River, Prentice hall, NJ, 1996.