cover
Contact Name
Lyra Yulianti
Contact Email
lyra@sci.unand.ac.id
Phone
-
Journal Mail Official
lyra@si.unand.ac.id
Editorial Address
http://jmua.fmipa.unand.ac.id/index.php/jmua/index
Location
Kota padang,
Sumatera barat
INDONESIA
Jurnal Matematika UNAND
Published by Universitas Andalas
ISSN : 2303291X     EISSN : 27219410     DOI : -
Core Subject : Science, Education,
Fokus dan Lingkup dari Jurnal Matematika FMIPA Unand meliputi topik-topik dalam Matematika sebagai berikut : Analisis dan Geometri Aljabar Matematika Terapan Matematika Kombinatorika Statistika dan Teori Peluang.
Arjuna Subject : -
Articles 898 Documents
CONNECTIVITY INDICES OF POWER GRAPH OVER DIHEDRAL GROUPS D2pq Arif Munandar
Jurnal Matematika UNAND Vol. 15 No. 4 (2026)
Publisher : Department of Mathematics and Data Science, Universitas Andalas

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

Abstract

The dihedral group, fundamentally characterized by its rotational and reflectional symmetries, serves as an intriguing object of study when represented as a graph. Recently, the study of power graphs and their topological indices has gained significant attention in algebraic graph theory. In this study, we investigate the structural properties of the undirected power graph over the dihedral group D2n specifically for the composite order n=pq, where p and q are distinct odd primes. By determining the precise vertex degrees and connectivity patterns within the graph, this paper mathematically derives the exact formulas for five prominent connectivity indices: the first Zagreb index, the Wiener index, the hyper-Wiener index, the Harary index, and the Forgotten index. The results provide a deeper understanding of how the interplay between symmetry elements and the product of two distinct primes influences the topological descriptors of the associated power graph.
STABILITY ANALYSIS OF A DENGUE MODEL WITH AWARENESS AND REINFECTION Moch.Zakky; Budi Priyo Prawoto
Jurnal Matematika UNAND Vol. 15 No. 4 (2026)
Publisher : Department of Mathematics and Data Science, Universitas Andalas

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

Abstract

This study proposes and analyzes a mathematical model of dengue transmission incorporating awareness and reinfection effects. The human population is divided into susceptible unaware, susceptible aware, exposed, infected, and recovered compartments, while the mosquito population is classified into susceptible and infected classes. The model is formulated as a system of nonlinear ordinary differential equations. The basic reproduction number is derived using the next-generation matrix approach to determine the threshold condition for disease transmission. The existence and stability of the disease-free equilibrium are analyzed using the Jacobian matrix. The results show that the disease-free equilibrium is locally asymptotically stable when the basic reproduction number is less than one, and unstable otherwise. Numerical simulations are performed to illustrate the analytical findings and to examine the impact of awareness and reinfection on disease dynamics. The results indicate that increasing public awareness can significantly reduce disease transmission, while reinfection contributes to the persistence of dengue in the population. These findings highlight the importance of awareness-based interventions in controlling dengue outbreaks.
OPTIMIZATION OF TOURIST ROUTES IN BATAM CITY USING INTEGER LINEAR PROGRAMMING WITH DESTINATION CATEGORY CONSTRAINTS Andro Kurniawan; Syifaul Janan; Yoli Agnesia; Agustina Veronika
Jurnal Matematika UNAND Vol. 15 No. 4 (2026)
Publisher : Department of Mathematics and Data Science, Universitas Andalas

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

Abstract

Tourist route planning plays an important role in improving travel efficiency and visitor experience in urban tourism areas. Batam City offers numerous tourist destinations with diverse characteristics, making route planning under realistic constraints a challenging task. Classical Traveling Salesman Problem (TSP) models assume that all destinations must be visited, which is often impractical in real-world tourism scenarios. Therefore, this study proposes an optimization model for tourist route planning in Batam City using Integer Linear Programming (ILP) with destination category constraints. The proposed model allows a subset of destinations to be selected from a larger candidate set while determining the optimal visiting sequence. The objective function minimizes the total travel distance based on fixed driving distances obtained from digital map services. The model incorporates several constraints, including route continuity, subtour elimination, and category restrictions that limit the number of destinations selected from specific categories, such as beaches, shopping malls, and cultural sites. The model is implemented in Python using the PuLP optimization library and evaluated across four scenarios with varying category constraint settings. In the main scenario, the model produces an optimal route visiting 11 destinations with a total travel distance of 123.6 km. Scenario analysis further demonstrates that destination category selection significantly affects the total travel distance, with differences of up to 53.8% across scenarios despite a constant number of selected destinations. These findings indicate that ILP provides a flexible and effective framework for constrained tourist route optimization in urban tourism contexts. Furthermore, category-based constraints offer valuable insights into the trade-off between destination diversity and route efficiency.
ON METRIC DIMENSION IN GENERALIZED PARACHUTE GRAPH AND DUTCH WINDMILL GRAPH CORONA NULL GRAPH Tri Atmojo Kusmayadi; Laili Dhani Ramadhan; Fadila Yogi Syahidatun Wahidah
Jurnal Matematika UNAND Vol. 15 No. 4 (2026)
Publisher : Department of Mathematics and Data Science, Universitas Andalas

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

Abstract

This paper discusses the metric dimension of generalized parachute graphs and Dutch windmill graph corona null graphs. The objective of this study is to determine the metric dimension of both graph classes. The method used in this research is a literature study based on related books and journal articles concerning metric dimension. The results show that the metric dimension of generalized parachute graphs and Dutch windmill graph corona null graphs depends on the number of vertices in the constituent graphs.
SEMIPARAMETRIC CONTINUOUS MORTALITY MODELING VIA GAUSSIAN PROCESS RESIDUAL CORRECTION ON TMPI 2023 Sandy Salomo Saruan; Gusti Ayu Dwi Yanti; Fitrotunnisa Fitrotunnisa
Jurnal Matematika UNAND Vol. 15 No. 4 (2026)
Publisher : Department of Mathematics and Data Science, Universitas Andalas

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

Abstract

The Indonesian Population Mortality Table 2023 (TMPI 2023) provides graduated annual death probabilities at integer ages. This study proposes a semiparametric framework that combines a parametric backbone with a Gaussian Process (GP) correction of log-space residuals to construct continuous mortality functions for male and female populations. Two backbone families are considered: Gompertz and Heligman–Pollard, with fixed eight- and five-parameter variants of the latter. A Matérn $\nu = 5/2$ GP is fitted to residuals of annual cumulative hazards using an interval approximation. Annual death probabilities and survival are derived from a common integrated force, and curtate expectancy is distinguished from complete expectancy restricted to age 111. Evaluation uses 111 annual probabilities per sex and leave-one-age-out cross-validation that refits both the backbone and GP on each training set. Gompertz+GP achieves the lowest LOO RMSE among the evaluated candidates: $3.58881 \times 10^{-5}$ for males and $3.24246 \times 10^{-5}$ for females, compared with $0.00648539$ and $0.00590577$ for Gompertz alone. The absolute birth curtate-expectancy errors are below $0.16\%$ for the three GP-corrected specifications. These results support reconstruction of missing ages within the published table. Conditional pointwise latent-force intervals are provided, while source-estimation uncertainty, active parameter constraints, and within-year approximation limit the interpretation.
TRANSFORMATION OF COMPARTMENT MODELS INTO 1D RANDOM WALKS ON WEIGHTED DIGRAPHS Alfi Maulani; Andri Sofyan Husen
Jurnal Matematika UNAND Vol. 15 No. 4 (2026)
Publisher : Department of Mathematics and Data Science, Universitas Andalas

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

Abstract

This study constructs a transformation of a continuous dynamic compartment model into a Discrete-Time Markov Chain (DTMC) based on a onedimensional (1D) random walk, specifically emphasizing the combinatoric properties of a weighted digraph. The network’s combinatoric characteristics are analyzed through vertex decomposition of the compartments and the mapping of a weighted adjacency matrix to ensure flow conservation across each directed edge. The stability analysis of the system’s unique equilibrium point is conducted using network topology approaches via the Cyclic Small-Gain Theorem for Metzler matrices and spectral localization using Gershgorin’s Disc Theorem. The results demonstrate a robust structural consistency, where the combinatoric loop gain of the graph strictly ranges between 0 and 1, acting as a natural damping mechanism for the population. Furthermore, the stationary distribution of the micro-level random walk precisely converges to the macro-level equilibrium ratio, confirming a strict mathematical link between the combinatoric structure of the weighted graph and the stochastic behavior of the system.
A COMPUTATIONAL APPROACH TO DETERMINING THE LOCATING-CHROMATIC NUMBER OF PIZZA GRAPHS Agus Irawan; Asmiati Asmiati
Jurnal Matematika UNAND Vol. 15 No. 4 (2026)
Publisher : Department of Mathematics and Data Science, Universitas Andalas

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

Abstract

This study investigates the locating-chromatic number (L-cn) of the pizza graph Pzs using a computational approach implemented in Python. For s = 3, 4, 5, 6, 7, and 8, the program constructs the corresponding pizza graphs and determines their locating colorings. The computational results show that the locating-chromatic number of all tested pizza graphs is 4. These findings confirm previously reported results for s = 3 and s = 4, while different values are obtained for s = 5, 6, 7, and 8. In addition, the execution time increases significantly as the graph order grows. The results provide computational evidence for the locating-chromatic properties of pizza graphs and motivate further theoretical investigation.
OPTIMIZATION MODELING OF BIOGAS PRODUCTION PERFORMANCE FROM COW MANURE AND SUGARCANE TOPS USING THE GAUSS-NEWTON METHOD Susila Bahri; Christ Samuel Tobing
Jurnal Matematika UNAND Vol. 15 No. 4 (2026)
Publisher : Department of Mathematics and Data Science, Universitas Andalas

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

Abstract

This study models the biogas production kinetics of a mixture of cow manure and sugarcane tops using the Modified Gompertz Model to estimate the potential, rate, and lag phase duration of biogas production. The model parameters were estimated using the least squares method and the Gauss-Newton numerical iteration. By applying the cumulative biogas production data from the mixture under various treatments—namely control, C/N 20, C/N 30, and C/N 40—to the Gauss-Newton method, the three performance parameters for each treatment were successfully determined. The best parameter values were achieved by the control treatment, yielding an $R^2$ of 0.9994 and a Root Mean Square Error ($\text{RMSE}$) of 352.8769.