cover
Contact Name
Chairul Imron
Contact Email
cha_imron15@its.ac.id
Phone
+6285648721814
Journal Mail Official
limits.matematika@its.ac.id
Editorial Address
Departemen Matematika Fakultas Sains dan Analitika Data Institut Teknologi Sepuluh Nopember Sukolilo, Surabaya 60111, Indonesia Phone: +62-31-5943354 Email: limits.matematika@its.ac.id
Location
Kota surabaya,
Jawa timur
INDONESIA
Limits: Journal of Mathematics and Its Applications
ISSN : 1829605X     EISSN : 25798936     DOI : -
Core Subject : Science, Education,
Limits: Journal of Mathematics and Its Applications merupakan jurnal yang diterbitkan oleh Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember, Surabaya, Indonesia. Limits menerima makalah hasil riset di semua bidang Matematika, terutama bidang Analisis, Aljabar, Pemodelan Matematika, Sistem dan Kontrol, Matematika Diskrit dan Kombinatorik, Statistik dan Stokastik, Matematika Terapan, Optimasi, dan Ilmu Komputasi. Jurnal ini juga menerima makalah tentang survey literatur yang menstimulasi riset di bidang-bidang tersebut di atas.
Articles 287 Documents
Pemodelan dan Pembentukan Tabel Morbiditas-Mortalitas Stroke dan Penyakit Serebrovaskular dengan Model Multi Status Rantai Markov Waktu Kontinu Andini Setyo Anggraeni; Nahrul Hayati
Limits: Journal of Mathematics and Its Applications Vol. 23 No. 2 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v23i2.8716

Abstract

Stroke and cerebrovascular disease are major health challenges in Indonesia, with morbidity and mortality rates influenced by age and gender. This study aims to model the and to construct a morbidity-mortality table based on age and gender. The method used is Continuous Time Multistate Markov Chain modeling, combined with flow equations, orientation equations, and integration equations to form a decrement table. Transition probabilities  are calculated using Kolmogorov's forward differential equation. The results show that transition probability tables for men and women aged 20–90 years (t=1) are successfully formed and can be detailed down to a monthly or daily scale. Non-hemorrhagic stroke is the most common type of stroke, especially in healthy individuals aged over 40 years. Young hemorrhagic stroke patients are at high risk of recurrence, while men over 45 years are more susceptible to sequelae such as aphasia and hemiparasis, while women are at higher risk of non-hemorrhagic stroke. In patients with SNH, both men and women showed a sharp decline in the probability of recurrence after age 25, but the risk remained higher than for other types of stroke or sequelae. Stroke sequelae tended to persist in men until age 51 and in women until age 56, before declining. The risk of death within one year increased significantly with advancing age, with a dominant pattern of death from non-hemorrhagic stroke in men and hemorrhagic stroke in women. These findings provide important contributions to the health and actuarial world in planning interventions and managing stroke risk.
Pemodelan Spasial Temporal Emisi CO2 di ASEAN dengan Pendekatan Regresi Terboboti Geografis dan Temporal Nabil Naufal; Anik Djuraidah; Yenni Angraini; Alfa Nugraha Pradana
Limits: Journal of Mathematics and Its Applications Vol. 23 No. 2 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v23i2.8729

Abstract

Carbon dioxide (CO₂) emissions in the ASEAN region exhibit significant spatial and temporal heterogeneity, causing the relationship between emissions and their driving factors to vary across regions and time. This study aims to analyze the dynamics of the factors influencing CO₂ emissions in ASEAN countries using the Geographically and Temporally Weighted Regression (GTWR) method. The analysis utilized panel data from the 2018–2023 period, encompassing emissions data (EDGAR), environmental data (MODIS, ERA5), as well as socio-economic and energy data (World Bank, EMBER). The main results indicate a shift in dominant factors due to the COVID-19 pandemic. Before 2020, economic growth and electricity consumption were the primary drivers, whereas dince 2020, environmental factors (NDVI) and fossil fuel composition showed a more significant influence in several countries. The resulting GTWR model demonstrated very high performance with an R² value of 0.99, confirming the method's capability to capture local variations. This finding implies that emission mitigation policies in ASEAN must be adaptive to the evolving spatial contexts and temporal dynamics.
- Heterogeneous Fleet Vehicle Routing Problem dan Penyelesaiannya Menggunakan Metode Nearest Neighbor : Kasus Pendistribusian Ayam Potong Evi Yuliza; Novi Rustiana Dewi; Sisca Octarina; Indrawati Indrawati
Limits: Journal of Mathematics and Its Applications Vol. 23 No. 2 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v23i2.8956

Abstract

Distribution of goods using a heterogeneous fleet of vehicles is an important aspect in a logistics system because it affects distribution efficiency. This study aims to determine the optimal distribution route for broiler chickens using the Heterogeneous Fleet Vehicle Routing Problem (HFVRP) model to minimize the total vehicle mileage. The data used include customer locations, number of requests, vehicle capacity, heterogeneous vehicle types, and distances between locations. The problem is modeled in HFVRP by considering vehicle capacity, each customer is visited exactly once, and vehicles depart and return to the depot. The solution is carried out using the Nearest Neighbor method to generate distribution routes and compared with the optimal solution from the HFVRP model. The results show a total mileage of 88.6 km for the Nearest Neighbor method, while the optimal solution from the HFVRP model produces a total mileage of 121.2 km. Based on these results, the Nearest Neighbor method provides a more efficient route solution in the case of broiler chicken distribution.
Pelabelan Titik Bimagic Terbalik Super pada Path Related Graphs Amalia Rusita; Alifah Prameswari Yosi; Titin Martini
Limits: Journal of Mathematics and Its Applications Vol. 23 No. 2 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v23i2.9114

Abstract

A graph  is a connected, undirected, and simple graph where  is a set of vertices and  is a set of edges. Graph  with  vertices and  edges is said to admit a reverse vertex bimagic labeling if there exists a bijection  such that for each ,  for two distinct  and . Then, reverse vertex bimagic labeling is called super if label of edges are . A graph  that admits reverse super vertex bimagic labeling is called reverse super vertex bimagic graph.  The concept of reverse super vertex bimagic labeling in graph labeling arises from the existence of graphs that admit a reverse super vertex bimagic labeling but do not admit a reverse super vertex magic labeling. In addition, this concept aims to extend the range of magic constants, which were initially restricted to positive values, to include non-negative values. In this research, we investigated reverse super vertex bimagic labeling of path related graph, there are path graph , brush graph  and centipede tree graph .The method used is an explicit construction of a bijective labeling function .  The results show that path graph, brush graph  and centipede tree graph  are reverse super vertex bimagic graphs with the bimagic sums of each being , for path graph, , for brush graph, and  for centipede tree graph.
Kajian Analisis dan Simulasi Model Stokastik SIRS Pendekatan CTMC Putranto Utomo; Astri Wiliastri; Hadi Sumarno
Limits: Journal of Mathematics and Its Applications Vol. 23 No. 2 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v23i2.9115

Abstract

Infectious disease modelling has been widely developed through deterministic and stochastic approaches to describe transmission dynamics, disease persistence, and extinction. Various compartmental models, including SIS, SIRS, and SEIRS models and their modifications, have been proposed to represent different epidemiological mechanisms. This study investigates the transmission behaviour of infectious diseases using a stochastic Susceptible-Infected-Recovered-Susceptible (SIRS) model based on a Continuous-Time Markov Chain (CTMC) approach, with parameter values referring to tuberculosis data. The analysis shows that the effective reproduction number approaches the basic reproduction number as the ratio of initially susceptible individuals to the total population increases. When this ratio is close to one, the effective reproduction number approximates the basic reproduction number. The expected number of new infections is consistent with the basic reproduction number. The theoretical disease-free probability obtained from the branching-process formulation is 0.7075. Numerical simulations were conducted using 1,000 trajectories with a total population of 1,000 individuals. The simulation produced a disease-free probability of 0.7030, which is consistent with the theoretical result, with a relative error of 0.64%. The time to reach the disease-free state ranged from one day to 21 years, with an average of three years. For trajectories that remained endemic, the proportion of infected individuals ranged from 1.2% to 9.8%, with an average of 5.8%. These findings indicate that the stochastic CTMC approach provides a more detailed probabilistic interpretation of disease-free and endemic outcomes
Analisis Interaksi Populasi Hare dan Lynx Menggunakan Model Lotka-Volterra dengan Menerapkan Pertumbuhan Logistik dan Respon Fungsional Holling Tipe I dan II Nabila Agatha Parsa; Abadi Abadi
Limits: Journal of Mathematics and Its Applications Vol. 23 No. 2 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v23i2.9489

Abstract

This study discusses the modeling of hare and lynx population interactions using the Lotka–Volterra model, developed from real population data for both species from 1861–1880 (source: Hudson Bay Company/GitHub). This study uses two models: Model I, which applies logistic growth to the prey population (hare) with a Holling type I functional response, and Model II, which applies logistic growth to the prey population (hare) with a Holling type II functional response. The use of two models in this study aims to determine which model better represents the interaction between prey and predator. Both models are analyzed for their existence and stability of solutions. Furthermore, the model parameters, namely ?, the intrinsic growth rate of the prey population, ?, the rate of decline of the prey population due to interactions with predators, ?, the natural mortality rate of the predator population, d, the energy conversion efficiency from predation, and ?, the environmental carrying capacity, are estimated using two methods, namely Least Square Estimation (LSE) and Maximum Likelihood Estimation (MLE). The accuracy of both methods is assessed by comparing their total MSE values. The estimated parameter values ​​of both models with the smallest total MSE are used to determine numerical solutions for both models, which yield time series of hare and lynx populations. Comparison of the real data with numerical solutions from two models with different functional responses indicates that both models are relatively capable of representing the population dynamics of lynx and hares. However, the comparison results cannot conclude which model more realistically represents the dynamics of both populations simultaneously.
Bilangan Rainbow Connection pada Graf Siput dan Graf Ubur-Ubur Gema Hista Medika; Syafrizal Sy; Muhafzan; Zulfaneti
Limits: Journal of Mathematics and Its Applications Vol. 23 No. 2 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v23i2.9561

Abstract

The rainbow connection number is a topic in graph theory that studies the minimum number of colors required on the edges of a graph such that every pair of vertices is connected by a path with distinct edge colors. This study aims to determine the rainbow connection number of snail graphs and jellyfish graphs. The method used is a theoretical approach through structural analysis of graphs and the construction of minimum edge-coloring patterns that satisfy the rainbow connected property. The results show that the rainbow connection number of the snail graph Sl_n is rc(Sl_n)=4 for n=1,2, rc(Sl_n)=5 for n=3,4, and rc(Sl_n)=6 for n≥5. Meanwhile, for the jellyfish graph J_n, it is obtained that rc(J_n)=2n+1. These results indicate that the structure of a graph significantly influences the rainbow connection number. Although the diameter of the jellyfish graph is constant, the structural complexity causes the rainbow connection number to increase linearly with respect to n. This study is expected to contribute to the development of research on rainbow connection in special graphs.

Filter by Year

2004 2026


Filter By Issues
All Issue Vol. 23 No. 2 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 2 Edisi Ju Vol. 23 No. 1 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 1 Edisi Ap Vol. 22 No. 3 (2025): Limits: Journal of Mathematics and Its Applications Volume 22 Nomor 3 Edisi No Vol. 22 No. 2 (2025): Limits: Journal of Mathematics and Its Applications Volume 22 Nomor 2 Edisi Ju Vol. 22 No. 1 (2025): Limits: Journal of Mathematics and Its Applications Volume 22 Nomor 1 Edisi Ma Vol. 21 No. 3 (2024): Limits: Journal of Mathematics and Its Applications Volume 21 Nomor 3 Edisi No Vol. 21 No. 2 (2024): Limits: Journal of Mathematics and Its Applications Volume 21 Nomor 2 Edisi Ju Vol. 21 No. 1 (2024): Limits: Journal of Mathematics and Its Applications Volume 21 Nomor 1 Edisi Ma Vol. 20 No. 3 (2023): Limits: Journal of Mathematics and Its Applications Volume 20 Nomor 3 Edisi No Vol. 20 No. 2 (2023): Limits: Journal of Mathematics and Its Applications Volume 20 Nomor 2 Edisi Ju Vol. 20 No. 1 (2023): Limits: Journal of Mathematics and Its Applications Volume 20 Nomor 1 Edisi Ma Vol. 19 No. 2 (2022): Limits: Journal of Mathematics and Its Applications Volume 19 Nomor 2 Edisi No Vol. 19 No. 1 (2022): Limits: Journal of Mathematics and Its Applications Volume 19 Nomor 1 Edisi Me Vol. 18 No. 2 (2021): Limits: Journal of Mathematics and Its Applications Volume 18 Nomor 2 Edisi No Vol. 18 No. 1 (2021): Limits: Journal of Mathematics and Its Applications Volume 18 Nomor 1 Edisi Me Vol. 17 No. 2 (2020): Limits: Journal of Mathematics and Its Applications Volume 17 Nomor 2 Edisi De Vol. 17 No. 1 (2020): Limits: Journal of Mathematics and Its Applications Volume 17 Nomor 1 Edisi Ju Vol. 16 No. 2 (2019): Limits: Journal of Mathematics and Its Applications Volume 16 Nomor 2 Edisi De Vol. 16 No. 1 (2019): Limits: Journal of Mathematics and Its Applications Volume 16 Nomor 1 Edisi Ag Vol. 15 No. 2 (2018): Limits: Journal of Mathematics and Its Applications Volume 15 Nomor2 Edisi Nop Vol. 15 No. 1 (2018): Limits: Journal of Mathematics and Its Applications Volume 15 Nomor1 Edisi Mar Vol. 14 No. 2 (2017): Limits: Journal of Mathematics and Its Applications Volume 14 Nomor 2 Edisi No Vol. 14 No. 1 (2017): Limits: Journal of Mathematics and Its Applications Volume 14 Nomor 1 Edisi Me Vol. 13 No. 2 (2016): Limits: Journal of Mathematics and Its Applications Volume 13 Nomor 2 Edisi No Vol. 13 No. 1 (2016): Limits: Journal of Mathematics and Its Applications Volume 13 Nomor 1 Edisi Me Vol. 12 No. 1 (2015): Limits: Journal of Mathematics and Its Applications Volume 12 Nomor 1 Edisi Me Vol. 9 No. 1 (2012): Limits: Journal of Mathematics and Its Applications Volume 9 Nomor 1 Edisi Nove Vol. 8 No. 2 (2011): Limits: Journal of Mathematics and Its Applications Volume 8 Nomor 2 Edisi Nove Vol. 7 No. 2 (2010): Limits: Journal of Mathematics and Its Applications Volume 7 Nomor 2 Edisi Nove Vol. 6 No. 1 (2009): Limits: Journal of Mathematics and Its Applications Volume 6 Nomor 1 Edisi Mei Vol. 5 No. 1 (2008): Limits: Journal of Mathematics and Its Applications Volume 5 Nomor 1 Edisi Mei Vol. 4 No. 2 (2007): Limits: Journal of Mathematics and Its Applications Volume 4 Nomor 2 Edisi Nove Vol. 4 No. 1 (2007): Limits: Journal of Mathematics and Its Applications Volume 4 Nomor 1 Edisi Mei Vol. 3 No. 2 (2006): Limits: Journal of Mathematics and Its Applications Volume 3 Nomor 2 Edisi Nove Vol. 3 No. 1 (2006): Limits: Journal of Mathematics and Its Applications Volume 3 Nomor 1 Edisi Mei Vol. 2 No. 2 (2005): Limits: Journal of Mathematics and Its Applications Volume 2 Nomor 2 Edisi Mei Vol. 2 No. 1 (2005): Limits: Journal of Mathematics and Its Applications Volume 2 Nomor 1 Edisi Nove Vol. 1 No. 2 (2004): Limits: Journal of Mathematics and Its Applications Volume 1 Nomor 2 Edisi Nove Vol. 1 No. 1 (2004): Limits: Journal of Mathematics and Its Applications Volume 1 Nomor 1 Edisi Nove More Issue