Article Per Year (5 Year)
p-Index From 2021 - 2026
4.745
P-Index
This Author published in this journals
All Journal Pythagoras: Jurnal Matematika dan Pendidikan Matematika KADIKMA CAUCHY: Jurnal Matematika Murni dan Aplikasi Jurnal Daya Matematis UNEJ e-Proceeding BAREKENG: Jurnal Ilmu Matematika dan Terapan JTAM (Jurnal Teori dan Aplikasi Matematika) Jurnal Matematika UNAND JURNAL AXIOMA : Jurnal Matematika dan Pembelajaran JPKMI (Jurnal Pengabdian Kepada Masyarakat Indonesia) Contemporary Mathematics and Applications (ConMathA) Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika Jurnal Diferensial Fraktal: Jurnal Matematika dan Pendidikan Matematika As-Sidanah : Jurnal Pengabdian Masyarakat Jurnal Ilmu Pendidikan Sekolah Dasar Pattimura Proceeding : Conference of Science and Technology CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS International Journal of Computing Science and Applied Mathematics-IJCSAM
Rafiantika Megahnia Prihandini
Program Studi Pendidikan Matematika, Universitas Jember, Indonesia
Religion Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Energy Engineering Environmental Science Languange, Linguistic, Communication & Media Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Public Health Social Sciences Transportation Other

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

Found 31 Documents
Search

 1   2   3   4 
IMPLEMENTATION OF INTEGER PROGRAMMING USING THE BRANCH AND BOUND METHOD ASSISTED BY PYTHON IN OPTIMIZING THE PRODUCTION OF COOKIES Saranta, Nira Nityasa; Setiawani, Susi; Prihandini, Rafiantika Megahnia; CahyaPrihandoko, Antonius; Wihardjo, Edy
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 18 No 3 (2024): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol18iss3pp1423-1432

Abstract

Many people are interested in cookies. Due to the high consumer interest in cookies, many companies produce cookies with various variants, one of which is Rizky Bakery. The problem faced by Rizky Bakery is how to determine the amount of production of 6 types of cookies to reach the maximum profit. Rizky Bakery carries out production activities to meet high market demand and standard demand. This study constructs a model that accommodates both conditions. The model is solved by using the Branch and Bound method constraints on materials, manufacturing time, fee labor, payment for resellers, and production targets. The purpose of this research is to determine the total number program model and the optimal solution by maximizing the profit of cookie production using Branch and Bound. Optimization using the Branch and Bound method can utilize the Python programming language with a limit of 50 iterations. Data collection methods used for this research are interviews and documentation. The limitation of the problem in this research is that the model to be studied is limited to the average condition of demand is standard and when demand is high. The results of the analysis at times of high demand showed that the production of nastar cookies, castangel cookies, mawar cookies, putri salju cookies, peanut cookies, and custard cookies in 300-gram packaging respectively are 250, 45, 80, 39, 90, 150 and in 500-gram packages are 40, 10, 10, 6, 45, and 45. While, the result of standard demand in 300-gram packaging respectively are 100, 25, 50, 16, 50, 60 and the 500-gram packaging respectively are 10, 3, 10, 2, 10, 20. The profit earned when the demand is high is IDR 8,769,412.00 and the standard demand is IDR 3,769,504.00.
Numerical Modelling of Social Media Addiction Cases Using 15th Order Runge-Kutta Fatahillah, Arif; Prihandini, Rafiantika Megahnia; Hidayatullah, Arfan; Setiawani, Susi; Adawiyah, Robiatul
Jurnal Matematika UNAND Vol. 14 No. 4 (2025)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.14.4.400-410.2025

Abstract

The advancement of information technology has led to more and more people, especially teenagers, becoming addicted to using various social platforms. Despite being a very useful application for social interaction, the habit of spending excessive time on social media is prone to addiction so that teenagers can experience anxiety disorders, depression, health problems, and more. The purpose of this study is to determine the effectiveness of the 15th-order Runge-Kutta method in solving mathematical models in the case of social media addiction. The method used in this research uses experimental research and data collection is done by systematically observing and recording the research indicators. The research was conducted by observing the error, number of iterations, running time, and graphs. In this study, adolescents aged 15-18 years were divided into three compartment states which were modeled into mathematical equations. The results of this study indicate that the 15th order Runge-Kutta method is more effective for solving mathematical models on social media addiction compared to Ordinary Differential Equation (ODE).
COLORING r-DYNAMIC POINT ON CRICKET GRAPH Kusumawati, Nurita; Kristiana, Arika Indah; Alfarisi, Ridho; Adawiyah, Robiatul; Setiawan, Toto Bara; Prihandini, Rafiantika Megahnia
JURNAL DIFERENSIAL Vol 6 No 1 (2024): April 2024
Publisher : Program Studi Matematika, Universitas Nusa Cendana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35508/jd.v6i1.12191

Abstract

A graph is defined as an ordered set (V,E) where V is a non-empty set of elements called vertices and E is a set of edges which are finite and may be empty and each edge connects two different points of V(G).The r-dynamic coloring is defined as c:V(G)→{1,2,3,…,k} such that it satisfies the following conditions if uv∈V(G), then c(u)≠ c(v), and ∀v∈V(G), |c(N(v))|≥min⁡{r,d(v)}, for positive integers r and degree of vertex v. The purpose of r-dynamic coloring is to find the minimum chromatic number of graph coloring with unlimited parameter r. Dynamic coloring is performed on cricket graphs because no research has been done before. The method used in this research is the axiomatic deductive research method and the pattern detection method.
BILANGAN KROMATIK GRACEFUL PADA KELUARGA GRAF SENTRIPETAL Lestari, Deninta Dwi Ayu; Kristiana, Arika Indah; Prihandini, Rafiantika Megahnia; Alfarisi, Ridho; Setiawan, Toto Bara; Adawiyah, Robiatul
JURNAL DIFERENSIAL Vol 6 No 1 (2024): April 2024
Publisher : Program Studi Matematika, Universitas Nusa Cendana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35508/jd.v6i1.12746

Abstract

One of the topics studied in graphs is graph coloring. The definition of a graceful coloring, namely $k$-elegant coloring of a graph G is the exact vertex coloring c:V(G)→{ 1,2,...,k} where k≥2 induces the exact vertex coloring c^': V(G)→ {1,2,...,k-1} which is defined by c(uv)=|c(u)-c(v)|. The exact vertex coloring c of a graph G is a graceful coloring if c is a k-elegant coloring for k∈N. The graceful chromatic number is the minimum k value where graph G has k-elegant coloring, the elegant chromatic number of graph G is denoted by X_g (G). This article will discuss graceful chromatic numbers in the centripetal graph family which includes octopus graph (O_n), sandat graph (St_n),dutch windmill graph (D_3^m) , and a volcano graph (V_n).
An Inclusive Local Irregularity Vertex Coloring of Dutch Windmill Graph Kristiana, Arika Indah; Prahastiwi, Lusi Rizzami; Prihandini, Rafiantika Megahnia
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 8, No 2 (2023): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/ca.v8i2.17154

Abstract

Let G(V,E) is a simple and connected graph with V(G) as vertex set and E(G) as edge set. An inclusive local irregularity vertex coloring is a development of the topic of local irregularity vertex coloring. An inclusive local irregularity vertex coloring is defined by coloring the graph so that its weight value is obtained by adding up the labels of the neighboring vertex and its label. The inclusive local irregularity chromatic number is defined as the minimum number of colors obtained from coloring the vertex of the inclusive local irregularity in graph G. In this paper, we find the inclusive local irregularity vertex coloring and determine the chromatic number on the Dutch windmill graph using axiomatic deductive and pattern recognition methods. The results of this study are expected to be used as a basis for studies in the development of knowledge related to the inclusive local irregularity vertex coloring
b-coloring Analysis on Tree Graph Families Prihandini, Rafiantika Megahnia; Kristiana, Arika Indah; Dana, Lusita Risma; Wihardjo, Edy; Adawiyah, Robiatul; Zulnaidi, Hutkemri
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 11, No 1 (2026): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/cauchy.v11i1.32328

Abstract

A tree graph is a connected graph and has no circuits. Tree graphs used in this study include: broom graph, centipede graph, and Banana Tree graph. Graph coloring is the process of giving color to graph elements with the rule that neighboring elements must not have the same color, and the number of colors used must be as minimal as possible. b-coloring of a graph G is a coloring of the vertices of G such that each color class has at least one vertex adjacent to all other color classes. The b-chromatic number of a graph G is denoted by φ(G), is the largest integer k such that G has a b-coloring with k colors. The limit of b-coloring of graph G with maximum degree ∆(G) is as follows, χ(G) ≤ φ(G) ≤ ∆(G) + 1.χ(G) is the chromatic number of a graph G where χ(G) is the minimum value of the color required for proper coloring of graph G. While ∆(G) is the maximum degree of the vertices in graph G. This study uses an exploratory research type with an axiomatic deductive method and a pattern detection method. Based on this study, the results of the b-coloring analysis on the tree graph family are known. The results of this study are expected to be used as study material and the development of scientific knowledge related to b-coloring analysis on other graphs.
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.
Pengaruh Model Discovery Learning Dengan E-Worksheet Geogebra Terhadap Hasil Belajar Persamaan Garis Lurus Siswa Kelas VIII MTs Prihandini, Rafiantika Megahnia; Adawiyah, Robiatul
Fraktal : Jurnal Matematika dan Pendidikan Matematika Vol 6 No 2 (2025): November 2025
Publisher : Universitas Nusa Cendana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35508/fractal.v6i2.22872

Abstract

This study aims to analyze the effect of Discovery Learning with e-Worksheet GeoGebra on the learning outcomes of eighth-grade students at MTs AT-Taqwa Bondowoso. A quantitative study with a quasi-experimental design using a non-equivalent control group design was conducted with a control group (VIII D) and an experimental group (VIII C). The results of the study show that the use of e-Worksheet GeoGebra with the Discovery Learning method enhances student activity and learning outcomes. The homogeneity test (p = 0.155) and normality test (p > 0.05) indicated that the data were homogeneous and normally distributed. The gain score analysis showed a higher average score increase in the experimental group (11.81) compared to the control group (5.56). The posttest t-test (t = 3.8416, p = 0.001) and gain score t-test (t = 4.877, p = 0.000) showed significant differences between the two groups. Therefore, Discovery Learning using e-Worksheet GeoGebra has a significant effect and is more effective than the conventional method in improving student learning outcomes
STRENGTHENING MICRO, SMALL, AND MEDIUM ENTERPRISES DIGITAL MARKETING BASED ON LOCAL COMMUNITY EMPOWERMENT TO SUPPORT THE REALIZATION OF SDG’S IN SUCOLOR VILLAGE Prihandini, Rafiantika Megahnia; Adawiyah, Robiatul; Setiawanai, Susi; Dewi, Mayra Fadhilla
As-Sidanah Vol 7 No 2 (2025): OKTOBER
Publisher : LP2M Universitas Ibrahimy

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35316/assidanah.v7i2.455-468

Abstract

Sucolor Village possesses significant local economic potential, particularly in the Micro, Small, and Medium Enterprises (UMKM) sector. However, the utilization of digital technology for product marketing remains limited, resulting in restricted market access and low competitiveness of local products. This activity aims to optimize digital marketing strategies based on local community development to support UMKM sustainability and contribute to the achievement of the Sustainable Development Goals (SDGs) in Sucolor Village. The method employed in this initiative is the ADDIE training model, which includes digital marketing training, branding optimization, and marketing strategies based on social media and e-commerce. This activity involves empowering the local community, particularly women and youth groups, to enhance digital skills and product innovation. As a result of this program, participants demonstrated significant improvement in digital marketing competence, with average post-training scores increasing from 1.7-2.3 to 3.9-4.3 across key indicators such as branding, content creation, and marketplace management. A digital catalog website was successfully developed, and local UMKM began actively promoting their products online. Additionally, the introduction of coffee-themed batik products reinforced local identity and broadened the creative economy. Overall, this community service proved to be an effective way to enhance digital literacy, expand market reach, and increase the economic resilience of rural entrepreneurs.
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 Abdurrahman Salim Afifah, Ngizatul Afni, Anis Nur Agatha, Alvian Bagus Ahmad Musyaffa' Hikamuddin Alfin Nabila Taufik Angrenani, Arin Berliana Arif Fatahillah Arika Indah Kristiana Asari, Okta Endri Bea Hana Siswati CahyaPrihandoko, Antonius D. Dafik Dafik Dana, Lusita Risma Deddy Setyawan Dewi, Mayra Fadhilla Dian Kurniati Ermita Rizki Albirri Hidayatullah, Arfan Ika Hesti Agustin, Ika Hesti Kusumawati, Nurita Lestari, Deninta Dwi Ayu Lioni Anka Monalisa, Lioni Anka Muhammad Usaid Hudloir Orel Revo Sackhi Usdelivian Pradista, Vyke Triawilly Prahastiwi, Lusi Rizzami Putri, Inge Wiliandani Setya Ridho Alfarisi Ridho Alfarisi, Ridho Rizki Aulia Akbar Robiatul Adawiyah Robiatul Adawiyah Rohini, A Saddam Hussen Saranta, Nira Nityasa Setiawanai, Susi Siddiqui, M. Kamran Susi Setiawani Toto Bara Setiawan WIHARDJO, EDY Yunta, Girlyas Rasta Zulnaidi, Hutkemri