Complementary Edge-Magic Total Labelings of Cycle Graphs

Abstract

In an edge-magic total labeling, the integers 1, 2,..., p+q are assigned in a bijective manner to the vertices and edges of a graph G(p, q) in such a way that the edge-sum f(u) + f(uv) + f(v) remains constant at k for each and every edge uv. For every edge-magic labeling f, its corresponding labeling f̄, which can be expressed as f̄(x) = p + q + 1 − f(x), is also edge-magic. This results in a detectable change in the magic constant. In this study, cycle graphs C_n are investigated, and it is shown that every cycle has an edge-magic labeling and that the complement of that labeling is likewise edge-magic. As a result, every cycle possesses a complementary edge-magic property. For the residue classes n ≡ 0 (mod 4) and n ≡ 2 (mod 4), we present explicit constructs for odd and even cycles. These constructs enhance the conventional cycle constructions while stressing a separate extra meaning. The constructions are demonstrated through the use of illustrative instances and a labeled figure, which also serves to validate the ensuing constant edge sums for both the original and complementary labeling structures.

Country : Sultanate of Oman

1 Mallikarjun Ghaleppa2 Amit kumar Yadav3 Farheen Fathima4 Amabella Oliva Enanoria5 Ramesh Palanisamy

  1. Mathematics and Computing Unit, Preparatory Studies Center, University of Technology and Applied Sciences, Ibra, Oman
  2. Mathematics and Computing Unit, Preparatory Studies Center, University of Technology and Applied Sciences, Ibra, Oman
  3. Mathematics and Computing Unit, Preparatory Studies Center, University of Technology and Applied Sciences, Ibra, Oman
  4. Mathematics and Computing Unit, Preparatory Studies Center, University of Technology and Applied Sciences, Ibra, Oman
  5. College of Computing and Information Sciences, University of Technology and Applied Sciences, Ibra, Oman

IRJIET, Volume 9, Issue 12, December 2025 pp. 163-166

doi.org/10.47001/IRJIET/2025.912025

References

  1. Al-Addasi, S., Al-Sarhan, A., & Al-Raqab, O. (2023). Efficient graph network magic labelings for secure communications. Mathematics, 11(19), Article 4132. https://doi.org/10.3390/math11194132
  2. Amutha, R. S., & Swaminathan, V. (2013). New complementary super edge-magic constructions. International Journal of Advances in Engineering & Technology, 6(6), 2791–2794.
  3. Bača, M., Lin, Y., Miller, M., & Simanjuntak, R. (2007). Antimagic labelings of regular graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 60, 3–21.
  4. Berkman, O., Parnas, M., & Roditty, Y. (2001). All cycles are edge-magic. Ars Combinatoria, 59, 145–151.
  5. Enomoto, H., Lladó, A. S., Nakamigawa, T., & Ringel, G. (1998). Super edge-magic graphs. SUT Journal of Mathematics, 34(2), 105–109.
  6. Figueroa-Centeno, R. M., Ichishima, R., & Muntaner-Batle, F. A. (2001). The place of super edge-magic labelings among other classes of labelings. Discrete Mathematics, 231(1–3), 153–168. https://doi.org/10.1016/S0012-365X(00)00314-9
  7. Gallian, J. A. (2022). A dynamic survey of graph labeling (25th ed.). The Electronic Journal of Combinatorics, DS6.
  8. Ichishima, R., Muntaner-Batle, F. A., & Oshima, A. (2019). Bounds for the strength in super edge-magic labelings. AKCE International Journal of Graphs and Combinatorics, 16(1), 106–111.
  9. Kotzig, A., & Rosa, A. (1970). Magic valuations of finite graphs. Canadian Mathematical Bulletin, 13(4), 451–461.
  10. López, S. C., Muntaner-Batle, F. A., & Rius-Font, M. (2007). Cycle-magic graphs and labelings. Discrete Mathematics, 307(11–12), 1405–1409.
  11. López, S. C., Muntaner-Batle, F. A., & Rius-Font, M. (2023). New problems on valences in edge-magic labelings. arXiv:2306.15986 [math.CO].
  12. Marr, A. M., & Wallis, W. D. (2013). Magic and antimagic graphs: Attributes, observations and conjectures. Springer.
  13. McQuillan, D. (2009). Magic labelings on cycles and wheels. Journal of Combinatorial Mathematics and Combinatorial Computing, 70, 157–172.
  14. Muntaner-Batle, F. A., Rius-Font, M., & Figueroa-Centeno, R. M. (2017). A new labeling construction from the h-product. Discrete Mathematics, 340(5), 1054–1062.
  15. Rosa, A. (1967). On certain valuations of the vertices of a graph. In Theory of Graphs: International Symposium (Rome, 1966) (pp. 349–355). Gordon and Breach; Dunod.
  16. Roy, S., & Akka, D. G. (2012). On complementary edge magic labeling of certain graphs. American Journal of Mathematics and Statistics, 1(1), 21–25. https://doi.org/10.5923/j.ajms.20110101.04
  17. Sindhu, M., & Vijayalakshmi, S. (2020). Labeling of 2-regular graphs by odd edge magic. Journal of Mathematics and Computer Science Management, 4(2), 45–52.
  18. Sitohang, A. S., Sugeng, K. A., & Simanjuntak, R. (2018). Edge magic total labeling of cycle book graphs. Journal of Physics: Conference Series, 1116, Article 022043. https://doi.org/10.1088/1742-6596/1116/2/022043
  19. Swita, R., Sugeng, K. A., & Simanjuntak, R. (2019). Edge magic total labeling of (7,3)-cycle books. International Journal of Mathematics and Mathematical Sciences, 2019, Article 1801925. https://doi.org/10.1155/2019/1801925
  20. Ullah, M., Javaid, M., & Slamin. (2023). Type (a,b,c) face-magic labelings of prism graphs. Combinatorics Press, 1–15.
  21. Wallis, W. D. (2000). Edge-magic total labelings. Australasian Journal of Combinatorics, 22, 177–190.