Volume 67 | Issue 12 | Year 2021 | Article Id. IJMTT-V67I12P504 | DOI : https://doi.org/10.14445/22315373/IJMTT-V67I12P504
A.A. Sathakathulla, M.G Fajlul Kareem, "Prime Cordial Labeling for Eight Sprocket Graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 67, no. 12, pp. 41-46, 2021. Crossref, https://doi.org/10.14445/22315373/IJMTT-V67I12P504
[1] F. Harary, Graph theory, Narosa Publishing House, (2001).
[2] G. S. Bloom and S. W. Golomb, Application of numbered undirected graphs, IEEE, 65(1977), 562-570.
[3] I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin, 23(1987), 201-207.
[4] J. A. Gallian, A Dynamic survey of graph labeling, The Electronics Journal of Combinatorics, 22(2019).
[5] J. C. Kanani and V. J. Kaneria , Cordial Labeling for Eight Sprocket Graph, Int. J. Math. And Appl., 9(1)(2021), 67{72}
[6] J. C. Kanani and V. J. Kaneria, Graceful Labeling for Eight Sprocket Graph, Recent Advancements in Graph Theory, 2020 (1), CRC Press.
[7] S. K. Vaidya_ and N. H. Shah, Prime cordial labeling of some wheel related graphs, Malaya Journal of Matematik 4(1)(2013) 148–156
[8] S K Vaidya and P L Vihol Prime Cordial Labeling For Some Cycle Related Graphs, Int. J. Open Problems Compt. Math., 3(5) (2010)
[9] S. W. Golomb, How to number a graph, Graph Theory and Computing , (R. C. Read. Ed.) Academic Press, (1972), 23{37}.
[10] V. J. Kaneria, H. P. Chudasama and P. P. Andharia, Absolute mean graceful labeling in path union of various graphs, Mathematical Journal of Interdisciplinary Sciences, 7(2018) 51-56.