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
ON N-SOFT HYPERGRAPH Luthfi Hadiyan Fajri; Yanita Yanita; Admi Nazra; Monika Rianti Helmi
Jurnal Matematika UNAND Vol. 15 No. 3 (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.3.418-426.2026

Abstract

In this paper we explore the notion of N-soft hypergraphs, which is an hybridization of N-soft set and hypergraph. Next, we define strong N-soft hypergraphs, and induced complete N-soft hypergraphs. We present the definitions of some of their unary operations and examine their properties. Then, we give illustration on how N-soft hypergraph will be applied in portray real-life problem.
THE MOORE–PENROSE INVERSE OF SYMMETRIC MATRICES WITH EQUITABLE PARTITIONS AND DIVISOR MATRICES Desi Lira Antika; Yanita Yanita; Monika Rianti Helmi
Jurnal Matematika UNAND Vol. 15 No. 3 (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.3.427-435.2026

Abstract

A balanced partitioned symmetric matrix is a matrix that has partition blocks that have the same average number of rows and columns. The sum of these average rows and columns is then arranged into a matrix, which is called the divisor matrix. The purpose of this paper is to analyze the relationship between the Moore-Penrose inverse divisor matrix of a balanced partitioned symmetric matrix A and the Moore-Penrose inverse divisor matrix of A. Furthermore, it is obtained that the divisor matrix of the Moore-Penrose inverse of matrix A is the same as the Moore-Penrose inverse of the divisor matrix of A.
A MATHEMATICAL MODEL SEABRQ WITH OPTIMAL CONTROL FOR SOCIAL MEDIA ADDICTION INCORPORATING COGNITIVE DYSREGULATION EVA SALSABILA; Yudi Ari Adi
Jurnal Matematika UNAND Vol. 15 No. 3 (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.3.388-405.2026

Abstract

This study proposes a SEABRQ compartmental model to analyze social media addiction transmission and its cognitive consequences, referred to as cognitive dysregulation or 'brain rot.' The total population is partitioned into six compartments: Susceptible (S), Engaged (E), Addicted (A), Cognitively Dysregulated (B), Regulated (R), and Quit (Q). $R_0$ is computed using the next-generation matrix approach, and local asymptotic stability of both equilibrium points is established analytically. Sensitivity analysis identifies transmission rate and contact rate as the parameters most strongly amplifying $R_0$. An optimal control framework is incorporated into the model with two time-dependent control variables: $u_1(t)$, representing preventive and early regulation interventions targeting susceptible and engaged populations, and $u_2(t)$, representing treatment and behavioral support directed at addicted and cognitively dysregulated individuals. The optimal control problem is solved by applying Pontryagin’s Maximum Principle. Numerical simulations using the fourth-order Runge-Kutta method demonstrate that the combined application of both controls produces the most significant reduction in social media addiction persistence and its cognitive dysregulation effects over a five-year horizon.
THE FIRST FUNDAMENTAL GROUP OF THE PERMUTATION GROUP Aidil Adrianda Afrizal; Yanita Yanita
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.460-465.2026

Abstract

This study aims to determine the elements of the first fundamental group based on identity graphs derived from permutation groups, particularly those representing symmetric groups. Identity graphs are constructed by treating vertices as group elements and connecting them with edges when their product results in the identity element. The research focuses on identifying the components of the first fundamental group within these graph structures. The elements of the fundamental group are interpreted as sets of equivalent closed paths that start and finish at the same vertex. The findings indicate that the number of these equivalence classes in a fundamental group constructed from an identity graph reflects specific graph structures, offering new perspectives on the connection between permutation groups and graph theory.
A STUDY OF THE IMPACT OF BOUNDS ON TOPOLOGICAL INDICES WITH SELECTED MODEL OF THE ALBERTSON INDEX AND THE SIGMA INDEX Jasem Hamoud; Duaa Abdullah
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.481-494.2026

Abstract

In this paper, we investigate the impact of bounds on selected topological indices by examining their extreme values. We consider the Albertson index and the Sigma index as the selected models. The Sigma index is defined as the sum of the squared differences between the degrees of adjacent vertices in a graph. Additionally, we derive bounds for the minimum and maximum Albertson indices for various tree structures. We also establish upper and lower bounds involving parameters such as the maximum degree and the minimum degree.
EVALUATION AND DEVELOPMENT OF MACHINE-LEARNING-BASED COMPLIANCE SCORING MODELS FOR ALCOHOLIC BEVERAGES EXCISE TAXPAYER IN INDONESIA WITH INNOVATIVE ENCODING STRATEGY Boy Riansyah; Bagus Sartono; Farit M Afendi
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.495-505.2026

Abstract

The transformation of categorical variables as part of the feature engineering process is a critical stage in classification modeling because it determines the quality of the information representation used throughout model development. This issue is particularly relevant to the development of a compliance scoring model for excise taxpayers producing or importing alcoholic beverages in Indonesia, where all predictor variables are categorical. The compliance scoring model currently implemented by the Directorate General of Customs and Excise (DGCE) is based on a manually constructed scorecard in which the categorization of predictor variables is determined subjectively. Moreover, the existing model has not been empirically validated to represent the probability of compliance violations. This study aims to evaluate the current excise compliance scoring model while developing data-driven alternatives using logistic regression and the Categorical Boosting (CatBoost) algorithm with innovative categorical encoding strategies. Two encoding methods are compared: Weight of Evidence (WoE), representing a conventional statistical approach, and Ordered Target (OT), which is adapted from the CatBoost encoding mechanism. All models are validated using repeated k-fold cross-validation and evaluated based on the Area Under the Receiver Operating Characteristic Curve (AUC), the Kolmogorov–Smirnov (KS) statistic, and several additional performance metrics. The results demonstrate that OT encoding consistently outperforms WoE across all logistic regression scenarios, increasing the KS statistic from 0.27 for the existing compliance scoring model to 0.34 with WoE and 0.42 with OT. Furthermore, the CatBoost model achieves superior predictive performance compared with both logistic regression models (AUC = 0.715; KS = 0.471), indicating stronger discriminative ability in identifying compliance violations. These findings demonstrate that integrating target-based encoding with boosting algorithms produces a more adaptive and accurate compliance scoring model, providing a robust analytical framework to support risk-based excise supervision in Indonesia.
ON THE METRIC DIMENSION OF BUCKMINSTERFULLERENE-TYPE (B60(1, t)) FOR 1 Des Welyyanti; Mutia Amalia; Lyra Yulianti; Rifda Sasmi Zahra
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.611-623.2026

Abstract

Let G = (V, E) be a connected graph with vertex set V(G) and edge set E(G). For any two vertices u and v in G, the length of the shortest path between u and v in G is denoted by d(u, v). Let A = {a1, a2, ..., ak} be an ordered set of vertices of a connected graph G, and let v be a vertex in V(G). The representation of vertex v with respect to A, denoted by r(v|A), is defined as r(v|A) = (d(v, a1), d(v, a2), ..., d(v, ak)). If every pair of distinct vertices in G has distinct representations with respect to A, then A is called a resolving set of G. A resolving set with minimum cardinality is called a minimum resolving set, and its cardinality is called the metric dimension of G, denoted by dim(G). In this paper, we discuss the metric dimension of the Buckminsterfullerene-type graph, denoted by B60(1, t), for 1 <= t <= 5. Specifically, the main results reveal that dim(G) = 4 for t = 1 and dim(G) = 2t + 1 for 2 <= t <= 5.
CONSUMER SWITCHING BEHAVIOR AND CAFE COMPETITIVE STRATEGIES IN THE UNIVERSITAS NEGERI GORONTALO AREA: A MARKOV CHAIN AND GAME THEORY APPROACH Nurfadillah Rahmadaniyah Isa; Monica Pratiwi; Jamal Darusalam Giu
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.575-593.2026

Abstract

The increasing number of cafes surrounding university campuses intensifies market competition and heightens the potential for consumer switching behavior. This study aims to analyze consumer switching patterns and identify optimal competitive strategies among five cafes located near Campus 1 of Universitas Negeri Gorontalo. The Markov Chain method was employed to model consumer transition probabilities and estimate the steady-state market share distribution. In addition, Game Theory was applied to identify optimal competitive strategies based on the marketing mix framework (product, price, place, and promotion). The Markov Chain analysis indicates that the steady state is achieved in the eighth period. At equilibrium, the highest visit probability is observed for Kafe B (29.66%) and Kafe A (29.03%), followed by Kafe E (18.13%), Kafe D (14.87%), and Kafe C (8.32%). The Game Theory analysis reveals that Kafe A and Kafe B demonstrate competitive advantages in location strategy, Kafe C in product strategy, and Kafe D and Kafe E in price strategy. The integration of Markov Chain and Game Theory provides an understanding of consumer switching dynamics and offers an analytical basis for strategic decision-making to enhance cafe competitiveness in the university-area market.
ON PRIME LABELING OF TYPE I STAR FLOWER GRAPH AND THE COMB PRODUCT WITH STAR GRAPH Nur Fikriyah Alkamila; Desi Rahmadani; Mochammad Hafiizh
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.506-514.2026

Abstract

Prime labeling is a bijective labeling of the vertices of a graph such that every pair of adjacent vertices receives relatively prime integers. A graph that admits such a labeling is called a prime graph. This paper studies the prime labeling of a modified type I star flower graph, denoted by $SFl_{p,q}(1)$, and the graph obtained from the comb operation between $SFl_{p,q}(1)$ and the simple graph $S_1$. The results show that the star flower graph $SFl_{p,q}(1)$ is a prime graph for every $p \ge 3$. Furthermore, the comb product $SFl_{p,q}(1) \triangleright_o S_1$ is also a prime graph.
ON EDGE IRREGULAR LABELING WITH MINIMUM DISTINCT INTEGER LABELS FOR SOME STANDARD GRAPHS Husnul Khotimah; Fitriana Hasnani; Meryta Febrilian Fatimah
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.551-564.2026

Abstract

In this paper, we introduce a new variant of edge irregular labeling on graphs. For a simple graph G, let f be an edge labeling, where S is a finite set of nonnegative integers, and define the weight of each vertex as the sum of the labels of all incident edges. In the case where all vertex weights are pairwise distinct, then the labeling is called edge irregular. We define the minimum distinct edge-label number of G, denoted by md G, as the minimum cardinality of a label set S for which G admits such a labeling. This parameter may be viewed as a distinct irregularity type invariant, since it minimizes the number of distinct labels used rather than the largest label value. We establish exact values of md G for three standard graph families: paths, cycles, and stars. The obtained results demonstrate that this parameter exhibits different behavior across these graph classes and is strongly influenced by local degree structure and edge incidence patterns.