cover
Contact Name
Sutrisno Sutrisno
Contact Email
s.sutrisno@live.undip.ac.id
Phone
+62247474754
Journal Mail Official
admin.math@live.undip.ac.id
Editorial Address
Jl. Prof Soedarto, SH, Tembalang, Semarang, Indonesia 50275
Location
Kota semarang,
Jawa tengah
INDONESIA
Journal of Fundamental Mathematics and Applications (JFMA)
Published by Universitas Diponegoro
ISSN : 26216019     EISSN : 26216035     DOI : https://doi.org/10.14710
Core Subject : Science,
Journal of Fundamental Mathematics and Applications (JFMA) is an Indonesian journal published by the Department of Mathematics, Diponegoro University, Semarang, Indonesia. JFMA has been published regularly in 2 scheduled times (June and November) every year. JFMA is established to highlight the latest update of mathematical researches in both theoretical and applied works. The scope in JFMA is pure mathematics and applied mathematics. All accepted papers will be published both in print and online versions. The online version can be accessed via the DOI link of each article. The print version can be ordered to the journal administrator. JFMA welcomes both theoretical and applied research work to be published in the journal. The topics include but are not limited to: (1) Mathematical analysis and geometry (2) Algebra and combinatorics (3) Discrete Mathematics (4) Mathematical physics (5) Statistics (6) Numerical method and computation (7) Operation research and optimization (8) Mathematical modeling (9) Mathematical Logic in Computer Science, Informatics, etc.
Articles 155 Documents
Estrada Index and Laplacian Estrada Index on the Non-Coprime Graph of the Dihedral Group of Prime PowerOrder Lia Fitta Pratiwi; I Gede Adhitya Wisnu Wardhana; Nur Idayu Alimon
Journal of Fundamental Mathematics and Applications (JFMA) Vol 9, No 1 (2026)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jfma.v9i1.26765

Abstract

Graphical representations of algebraic structures have become an important tool in modern mathematics and its applications. Graph theory, particularly spectral graph theory, is widely used across disciplines such as chemistry, physics, computer science, and network analysis to study structural and functional relationships. This study focuses on the non-coprime graph of the dihedral group \( D_{2n} \) with \(n=p^k \), where $p$ is a prime number, and \(k \in \mathbb{Z}^{+}\), analyzing two fundamental spectral parameters: the Estrada index and the Laplacian Estrada index, which are defined based on the eigenvalues of the graph’s adjacency and Laplacian matrices. The main result of this research is the derivation of explicit general formulas for both indices on the non-coprime graph of the dihedral group, contributing to the advancement of algebraic graph theory through spectral analysis.
batara-guru: A Python-Based Rule 30 Cellular Automaton Analyzer with Parallel Processing Sandy Hardian Susanto Herho; Gandhi Napitupulu
Journal of Fundamental Mathematics and Applications (JFMA) Vol 9, No 1 (2026)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jfma.v9i1.30152

Abstract

We present batara-guru, an open-source Python library for efficient Rule 30 cellular automaton simulation and analysis. Using Numba's just-in-time compilation and parallel processing, the implementation achieves sub-second execution for systems up to 2001 cells on standard laptop hardware, overcoming Python's traditional performance limitations. The library integrates rigorous mathematical formulation from discrete dynamical systems theory with practical tools including NetCDF data persistence and diagnostic metrics for compositional/local entropy and interface density. Performance benchmarks demonstrate simulation times of 0.01-1.27 seconds across spatial scales from 251 to 2001 cells. Analysis reveals scale-invariant properties with entropy converging to 0.73 bits and interface density saturating near 0.51, confirming Rule 30's chaotic behavior while indicating subtle deviations from randomness. By requiring only standard Python libraries and modest computational resources, this framework democratizes cellular automaton research, enabling sophisticated dynamical systems analysis without specialized hardware infrastructure.
OPTIMAL CONTROL MODEL OF DIVORCE DYNAMICS BY POST-MARRIAGE EDUCATION AND COUNSELING Bunga Noer Intan Permatasari; Zulaikha Zulaikha
Journal of Fundamental Mathematics and Applications (JFMA) Vol 9, No 1 (2026)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jfma.v9i1.28574

Abstract

Divorce is a complex social phenomenon with various causes, including in-compatibility between partners, poor communication, economic issues, and infidelity.This research was conducted by modifying the SMBD model with the addition of theHealthy Marriage (H) and Unhealthy Marriage (Uh) subpopulations, adapted from theMHUCKD model, and considering controls in the form of post-marriage education andcounseling, resulting in the SMHUhD model. The purpose of implementing controls isto minimize the Unhealthy Marriage (Uh) and Divorce (D) subpopulations, as well asthe intervention costs correlated with post-marriage education and counseling. The op-timal control condition is obtained by applying the Pontryagin’s Maximum Principle.Next, a numerical simulation was conducted using the 4th-order Runge-Kutta methodwith the Forward-Backward Sweep Method approach, where the state equations weresolved using a forward step and the costate equations were solved using a backwardstep. The research results show that educational control and counseling, when giventogether, can minimize the occurrence of divorce.
A Novel Approach to Topological Indices of the Power Graph Associated with the Quaternion of a Certain Order Muhammad Irfan Hidayat; Abdul Gazir Syarifudin
Journal of Fundamental Mathematics and Applications (JFMA) Vol 9, No 1 (2026)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jfma.v9i1.30537

Abstract

The power graph of a group $G$, denoted $\Gamma_G$, is defined as a graph whose vertices correspond to the elements of $G$. Two distinct vertices $a,b\in G$ re adjacent if and only if there exists a positive integer $m$ such that $a^m=b$ or $b^m=a$ This study investigates a new approach for computing the topological indices of the power graph associated with the generalized quaternion group $Q_{4n}$, where $n=p^k$, $p$ is prime number and $k\in\mathbb{Z}$. The proposed method relies on structural properties of the power graph, particularly its diameter, allowing the indices to be determined directly from the number of vertices and edges. This enables a more direct and simplified calculation process compared to conventional methods, which often require more detailed combinatorial analysis or case-based enumeration. The results obtained using this new approach match exactly with those derived through traditional techniques. This confirms that the proposed method is not only valid but also efficient in computing topological indices for the power graph of the generalized quaternion group. Overall, the findings demonstrate that structural characteristics of the power graph can be effectively utilized to streamline the computation of its associated indices.
M-Polynomial of Regular Divisor Graph of Finite Commutative Ring Payman Abbas Rashed; Mohammed N Authman
Journal of Fundamental Mathematics and Applications (JFMA) Vol 9, No 1 (2026)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jfma.v9i1.30612

Abstract

Let R be a finite commutative ring with identity, for all non-zero elements a and b in the ring R are adjacent if and only if a=a.b.a or b=b.a.b and a≠b , this graph is called by regular divisor graph and denoted by ℜ∂(R), with vertex set V(ℜ∂(R)) consists of elements of r∗(R)=Reg(R)−{0} and edge set E(ℜ∂(R))={(a,b)∶a=a.b.a or b=b.a.b ,a≠b≠0,a,bReg(R)−{0} } . We classify the finite commutative ring to get a special graph and we are going to study some properties of this graph, up to the R which is local, Boolean and field. And we study the M-polynomial of the regular divisor graph ℜ∂(R), and the general form of regulardivisor graph of R=Zp×Zq for any prime number p and q. In this paper we got somenew results with appear with the new graph.