Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal JTAM (Jurnal Teori dan Aplikasi Matematika) Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika
Asari, Okta Endri
Unknown Affiliation
Religion Education Mathematics Physics Other

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Super (a, d)-hyperedge antimagic total labeling on hypergraphs of the volcano graph, semi parachute graph, and comb product graph Adawiyah, Robiatul; Asari, Okta Endri; Dafik, Dafik; Kristiana, Arika Indah; Prihandini, Rafiantika Megahnia; Rohini, A
Alifmatika (Jurnal pendidikan dan pembelajaran Matematika) Vol 7 No 2 (2025): Alifmatika - December
Publisher : Fakultas Tarbiyah Universitas Ibrahimy

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35316/alifmatika.2025.v7i2.391-408

Abstract

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.
Application on Hypergraph in Vigenere Chiper Asari, Okta Endri; Dafik, Dafik; Adawiyah, Robiatul; Kristiana, Arika Indah; Prihandini, Rafiantika Megahnia
JTAM (Jurnal Teori dan Aplikasi Matematika) Vol 10, No 1 (2026): January
Publisher : Universitas Muhammadiyah Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31764/jtam.v10i1.34572

Abstract

Message protection remains a major focus in the field of cryptography. This study proposes a new development on the Caesar cipher algorithm by utilizing hypergraph as a keystream generation source. The research designs a super (a,d)-hyperedge antimagic total labeling method applied to three hypergraph structures (Volcano, Semi Parachute, and Comb) to generate the keystream. Security is evaluated using four mechanisms: brute force analysis, processing time, ciphertext character distribution, and ciphertext bit size. The findings prove that the hypergraph based approach is robust against brute force attacks, improve memory and time efficiency. Quantitatively, the Comb hypergraph demonstrates the best efficiency, achieving an encryption time of 0.0030 seconds for 512 bytes and superior storage efficiency (e.g., 136 bytes for 16 bytes ), outperforming the Semi Parachute and Volcano structures. The main contributions include the hypergraph labeling-based keystream generation algorithm, dynamic block key construction, and a Vigenere protocol that is more adaptive to storage constraints and computationally efficient..
Co-Authors Arika Indah Kristiana D. Dafik Rafiantika Megahnia Prihandini Robiatul Adawiyah Rohini, A