Edge cordial and total edge cordial labeling for eight sprocket graph


  • A. A. Sathakathulla Modul University Dubai
  • M. G Fajlul Kareem UTASA






Edge Cordial, Eight- Sprocket Graph, Path Union of Graphs, Cycle of Graphs, Star of a Graph.


This papers deals with the Edge cordial labeling of newly introduced eight sprocket graph. This graph is already proven as cordial and gracious in graph labelling. In our study we have further proved that Eight Sprocket graph related families of connected edge-cordial graphs. Also the path union of Eight Sprocket graph, cycle of Eight Sprocket graph and star of Eight Sprocket graph are Edge-cordial.


Author Biography

A. A. Sathakathulla, Modul University Dubai



[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. https://doi.org/10.1109/PROC.1977.10517.

[3] 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). https://doi.org/10.37236/27.

[5] J. C. Kanani and V. J. Kaneria , Cordial Labeling for Eight Sprocket Graph, Int. J. Math. And Appl., 9(1)(2021), 67{72} https://doi.org/10.1201/9781003038436-1.

[6] J. C. Kanani and V. J. Kaneria , Graceful Labeling for Eight Sprocket Graph, Recent Advancements in Graph Theory, 2020 (1), CRC Press. https://doi.org/10.1201/9781003038436-1.

[7] S. W. Golomb, How to number a graph, Graph Theory and Computing, (R. C. Read. Ed.) Academic Press, (1972), 23{37}. https://doi.org/10.1016/B978-1-4832-3187-7.50008-8.

[8] 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. https://doi.org/10.15415/mjis.2018.71008.

View Full Article: