Super (a, d)-hyperedge antimagic total labeling on hypergraphs of the volcano graph, semi parachute graph, and comb product graph
DOI:
https://doi.org/10.35316/alifmatika.2025.v7i2.391-408Keywords:
Hypergraph, Super (a, d)-Hyperedge Antimagic Total LabelingAbstract
In graph theory, understanding the labeling of graphs and hypergraphs provides valuable insights into their structural properties and applications. A hypergraph generalizes the notion of a conventional graph, defined as a mathematical structure built from a vertex set V and a hyperedge set E, where each hyperedge is allowed to connect two or more vertices simultaneously. The essential distinction between a graph and a hypergraph lies in their edges. While in a graph a single edge connects exactly two vertices, in a hypergraph a single hyperedge may connect any number of vertices, including two. A hypergraph is considered to admit a super (a, d) -hyperedge antimagic total labeling, such that the vertex label functions f: V(H) 1, 2, 3, ....., V(H) then f: E(H) V(H) + 1, ....., V(H) + V(H) and weight w(ei) = ∑ f(ei) + ∑ f(Vi,j), where i denotes the number of hyperedges, j represents the number of vertices contained in a hyperedge, and e_i refers to the set of vertices and its associated edges with weight w(ei) for each hyperedge. A super (a, d) -hyperedge antimagic total labeling is formulated as a labeling scheme based on arithmetic progressions, where ???? serves as the initial value and d denotes the common difference between consecutive labels. In this scheme, the total weight of a hyperedge is determined by deriving from the sum of the vertex labels and the label of the respective hyperedge. The labels are arranged in an arithmetic sequence, ensuring that each hyperedge has a distinct weight. This study focuses on several special classes of hypergraphs, namely, the volcano graph, the semi-parachute graph, and the comb product of graphs, to implement and examine the characteristics of the super (a, d)-hyperedge antimagic total labeling. By focusing on these graph classes, the study contributes to combinatorics by offering a deeper understanding of hypergraph labeling schemes and their potential applications in network theory, coding theory, and data modeling.
Downloads
References
A. Gallian, J. (2022). A dynamic survey of graph labeling. Mathematics & Statistics, 6(25), 4-623. https://experts.umn.edu/en/publications/a-dynamic-survey-of-graph-labeling-5
Adawiyah, R., & M. Prihandini, R. (2023). On local (a, d)-antimagic coloring of some specific classes of graphs title. https://books.google.co.id/books?hl=id&lr=&id=Vaa7EAAAQBAJ&oi=fnd&pg=PA156&dq=robiatul+adawiyah++local+2023&ots=DYO1i5xJzT&sig=GS68ngjg7ZztQXXHrp-059gqZHE&redir_esc=y#v=onepage&q&f=false
Adawiyah, R., M. Prihandini, R., & H. Agustin, I. (2023). On Local (a, d)-Antimagic Coloring of Some Specific Classes of Graphs. In Proceedings of the 6th International Conference on Combinatorics, Graph Theory, and Network Topology (ICCGANT 2022), 6(1),156-169. https://doi.org/10.2991/978-94-6463-138-8_14
Adawiyah, R., Makhfudloh, I. I., & M. Prihandini, R. (2023). Local edge (a, d)–antimagic coloring on sunflower, umbrella graph and its application. Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika, 5(1), 70-81. https://doi.org/10.35316/alifmatika.2023.v5i1.70-81
Arumugam, S., & Nalliah, M. (2012). of friendship graphs. 53, 237–243.
Bahmanian, M. A., & Sajna, M. (2015). Hypergraphs : connection and separation. 1–31.
Bretto, A. (2013). Hypergraph Theory. https://link.springer.com/book/10.1007/978-3-319-00080-0
Dafik, H. Agustin, I., & Faridatun, K. (2016). Super (a, d)− F n-antimagic total labeling for a connected and disconnected amalgamation of fan graphs. AIP Conference Proceedings, 1707(1), 1-12. https://doi.org/10.1063/1.4940804
Dafik, Jannah, E. S. W., Agustin, I. H., Venkatraman, S., Mursyidah, I. L., Alfarisi, R., & Prihandini, R. M. (2024). On (a, d)-hyperedge antimagic labeling of certain classes of hypergraphs: A new notion. 2nd International Conference on Neural Networks and Machine Learning 2023 (ICNNML 2023), 2(1), 173-183. https://doi.org/10.2991/978-94-6463-445-7_18
Dafik, Miller, M., Ryan, J., & Bača, M. (2009). On super (a, d)-edge-antimagic total labeling of disconnected graphs. Discrete Mathematics, 309(15), 4909–4915. https://doi.org/10.1016/j.disc.2008.04.031
Dasar, K., Dan, H., & Wardayani, A. (2020). Konsep dasar hipergraf dan sifat-sifatnya [Basic concepts of hypergraphs and their properties]. Jurnal Ilmiah Matematika dan Pendidikan Matematika, 12(2), 49-62. https://doi.org/10.20884/1.jmp.2020.12.2.3619
Hartsfield, N., & Ringel, G. (1990). Pearls in graph theory. https://books.google.co.id/books?hl=id&lr=&id=VMjDAgAAQBAJ&oi=fnd&pg=PP1&dq=Hartsfield,+N.,+and+Ringel,+G.+(1990).+Pearls+in+Graph+Theory. Academic Press&ots=AGLClgEeE_&sig=EYTa3CnihYw16J2Tasb0ohPALUQ&redir_esc=y#v=onepage&q&f=false
Muhammad, J. (2013). Labeling of Graphs and Hypergraphs. National University of Computer and Emerging Sciences Karachi.
Muthuselvi, N., & Devi, T. S. (2025). Local super (a, d) edge antimagic total labeling of graphs. IAENG International Journal of Applied Mathematics, 55(1), 254-259. https://www.iaeng.org/IJAM/issues_v55/issue_1/IJAM_55_1_28.pdf
Nadzima, U., & Martini, T. S. (2019). Super (a, d)-H-antimagic total labeling on wheel edge corona product with a path and a cycle. Journal of Physics: Conference Series, 1306(1), 1-6. https://doi.org/10.1088/1742-6596/1306/1/012007
Parag, T., & Elgammal, A. (2011). Supervised hypergraph labeling. In CVPR 2011, 2011(1), 2289-2296). https://doi.org/10.1109/CVPR.2011.5995522
Prihandini, R., & Adawiyah, R. (2022). On super (a, d)-edge antimagic total labeling of some generalized shackle of fan graph. International Journal of Academic and Applied Research, 6(4), 28-32. https://repository.unej.ac.id/xmlui/handle/123456789/111593
Saibulla, A., & Pushpam, P. R. L. (2025). On e-super ( a, d ) -edge antimagic total labeling of total graphs of paths and cycles. Communications in Combinatorics and Optimization, 10(4), 787-802. https://doi.org/10.22049/cco.2024.28592.1625
Series, C. (2016). The connected and disjoint union of semi jahangir graphs admit a cycle-super (a, d)-atimagic total labeling. Journal of Physics: Conference Series, 693 (1), 1-7. https://doi.org/10.1088/1742-6596/693/1/012006
Smita, B. (2021). (Super)(a, d) - H- Antimagic total labeling of super sub division of cycle. Arya Bhatta Journal of Mathematics and Informatics, 13(2), 275-290.
Sonntag, M. (2002). Antimagic vertex labelings of hypergraphs. Discrete Mathematics, 247(1–3), 187–199. https://doi.org/10.1016/S0012-365X(01)00175-3
Sumarno, D., Dafik, & Santoso, A. (2015). Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph. Jurnal Ilmu Dasar, 15(2), 123-130. https://doi.org/10.19184/jid.v15i2.1051
Tuczy, M. (2019). On cordial labeling of hypertrees. 21, 1–14.
Venkatraman, S., Rajaram, G., & Krithivasan, K. (2018). Unimodular hypergraph for DNA sequencing: A polynomial time algorithm. Proceedings of the National Academy of Sciences, India Section A: Physical Sciences, 90(1), 49-56. https://doi.org/10.1007/s40010-018-0561-z
You, A., Be, M., & In, I. (2018). On super local antimagic total edge coloring of some wheel related graphs. AIP Conference Proceedings, 2014(1), 1-7. https://doi.org/10.1063/1.5054492
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
COPYRIGHT NOTICE
Author (s) who publish in Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika agree to the following terms:
- The Author (s) submitting a manuscript do so on the understanding that if accepted for publication, copyright of the article shall be assigned to Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika, Tarbiyah Faculty of Ibrahimy University as the publisher of the journal. Consecutively, author(s) still retain some rights to use and share their own published articles without written permission from Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika. This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
- Copyright encompasses rights to publish and provide the manuscripts in all forms and media for the purpose of publication and dissemination, and the authority to enforce the rights in the manuscript, for example in the case of plagiarism or in copyright infringement.
- Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika and the Editors make every effort to ensure that no wrong or misleading data, opinions or statements be published in the journal. In any way, the contents of the articles and advertisements published in Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika are the sole responsibility of their respective authors and advertisers.
- The Copyright Transfer Form can be downloaded here [Copyright Transfer Form Alifmatika]. The copyright form should be signed originally and send to the Editorial Office in the form of original mail, scanned document to alifmatika[at]ibrahimy.ac.id or upload the scanned document in the comments column when sending the manuscript.
_by_Matematohir.jpg)
