Keywords:-

Keywords: Graph labeling, Cordial labeling, Path union, Cycle of graphs, n-antiprism graphs.

Article Content:-

Abstract

In this paper, the findings contribute to the understanding of cordial labeling in the context of n-antiprism graphs, opening avenues for further research in graph theory and combinatorics.

References:-

References

Andar, M., Boxwala, S. and Limaye N 2002 Cordial labelings of some wheel related graphs, J. Combin. Math. Combin. Comput., Vol.41. 203-208.

Andar, M., Boxwala, S. and Limaye N. 2005 New families of cordial graphs, J. Combin. Math.Combin. Comput. Vol.53. 117-154.

Cahit, I. 1987 Cordial Graphs: A weaker version of graceful and Harmonic Graphs, Arts Combinatoria, Vol. 23. 201-207.

Gallian, J. A. 2023 A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 1-644.

Jeba Jesintha, J. and Subashini, K. 2022 Cordial labeling in the path union and cycle of torch graph, Advances and Applications in Mathematical Sciences , Vol. 21. Issue 11. 6187-6195.

Vaidya, S. K., and Shah, N. H. 2015 Cordial labeling of degree splitting graphs, J. Graph Labeling, 1(2) 95-110.

Downloads

Citation Tools

How to Cite
Jesinth, J. J., Subashinir, K., & Mathew, D. S. (2024). Cordial Labeling on Families of N-Antiprism Graphs. International Journal Of Mathematics And Computer Research, 12(8), 4379-4381. https://doi.org/10.47191/ijmcr/v12i8.02