cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Nur Inayah
Contact Email
inprime.journal@uinjkt.ac.id
Phone
+6285280159917
Journal Mail Official
inprime.journal@uinjkt.ac.id
Editorial Address
Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah Jl. Ir H. Juanda No.95, Cemp. Putih, Kec. Ciputat, Kota Tangerang Selatan, Banten 15412
Location
Kota tangerang selatan,
Banten
INDONESIA
InPrime: Indonesian Journal Of Pure And Applied Mathematics
Published by Universitas Islam Negeri Syarif Hidayatullah Jakarta
ISSN : 26865335     EISSN : 27162478     DOI : 10.15408/inprime
Core Subject : Science, Education,
Computer Science & IT Mathematics
InPrime: Indonesian Journal of Pure and Applied Mathematics is a peer-reviewed journal and published on-line two times a year in the areas of mathematics, computer science/informatics, and statistics. The journal stresses mathematics articles devoted to unsolved problems and open questions arising in chemistry, physics, biology, engineering, behavioral science, and all applied sciences. All articles will be reviewed by experts before accepted for publication. Each author is solely responsible for the content of published articles. This scope of the Journal covers, but not limited to the following fields: Applied probability and statistics, Stochastic process, Actuarial, Differential equations with applications, Numerical analysis and computation, Financial mathematics, Mathematical physics, Graph theory, Coding theory, Information theory, Operation research, Machine learning and artificial intelligence.
Arjuna Subject : Matematika - Matematika Terapan
Articles 13 Documents
 1   2 
Search results for , issue "Vol 4, No 1 (2022)" : 13 Documents clear
E-Cordial Labeling for Cupola Graph Cu(3, b, n) Yulianti, Kartika; Rokhmatillah, Fitri; Sispiyati, Ririn
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol 4, No 1 (2022)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v4i1.24210

Abstract

Graph labeling is a map that maps graph elements such as vertices, edges, vertices, and edges to a set of numbers. A graph labeling is named e-cordial if there is a binary mapping f:E(G)→{0,1} which induces the vertex labeling defined by g(v)=Ʃ_{uvϵE(G)}f(uv)(mod 2), so that it satisfies the absolute value of the difference between the number of vertices labeled 1 and the number of vertices labeled 0 is less than equal to 1, and also for the number of edges labeled 0 and labeled 1. A graph that admits the e-cordial labeling is called an e-cordial graph. In this paper, we proved that some of the cupola graph Cu(3,b,n) is e-cordial.Keywords: E-Cordial Labeling; E-Cordial Graph; Cupola Graph Cu(a, b, n). AbstrakPelabelan graf merupakan pemetaan yang memetakan unsur-unsur graf seperti simpul, sisi, simpul dan sisi ke himpunan bilangan. Sebuah pelabelan dinamakan pelabelan e-cordial jika terdapat pemetaan biner f:E(G)→{0,1} yang menginduksi pelabelan simpul yang didefinisikan g(v)=Ʃ_{uvϵE(G)}f(uv)(mod 2) sehingga nilai mutlak dari selisih banyaknya simpul yang dilabeli 1 dan banyaknya simpul yang dilabeli 0 kurang dari sama dengan 1, dan nilai mutlak dari selisih banyaknya sisi yang dilabeli 1 dan banyaknya sisi yang dilabeli 0 kurang dari sama dengan 1. Sebuah graf yang dapat dilabeli secara e-cordial dinamakan graf e-cordial. Pada makalah ini dibuktikan bahwa beberapa graf kubah Cu(3,b,n) adalah e-cordial.Kata Kunci : Pelabelan E-Cordial; Graf E-Cordial; Graf Kubah Cu(a, b, n).
Stability Analysis of Leslie-Gower Model with Herd Behavior on Prey Dwi Putra, M. Adib Jauhari; Himayati, Ade Ima Afifa
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol 4, No 1 (2022)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v4i1.24464

Abstract

We studied the Leslie-Gower model of predator-prey with herd behavior. The square root functional response models predator and prey interactions that show herd behavior. This study aims to determine the formulation of the predator-prey model with herd behavior on prey, knowing the fixed points and its stability and simulating the model numerically. We found three fixed points that may exist: the extinction point of both species, the extinction of predator point, and the point of coexistence of the two species. The extinction of predator points is always unstable, while the point of coexistence of the two species can be stable under certain conditions. Due to the presence of square roots, the behavior of the solutions near the extinction point of the two species is not readily apparent. Numeric simulation shows that changing the initial condition and parameters can change the system's stability.Keywords: predator-prey; functional response; herd behavior; square root functional response, Leslie-Gower model. AbstrakArtikel membahas model predator prey Leslie-Gower dengan perilaku bergerombol pada prey. Interaksi predator dan prey yang menunjukkan perilaku bergerombol dimodelkan dengan fungsi respon akar kuadrat. Penelitian ini bertujuan untuk mengetahui formulasi model predator-prey dengan perilaku bergerombol pada prey, mengetahui titik ekuilibrium dan kestabilannya serta menyimulasikan model tersebut secara numerik. Hasil menunjukkan terdapat tiga titik tetap yang mungkin eksis, yaitu titik kepunahan kedua spesies, titik kepunahan predator dan titik koeksistensi kedua spesies. Titik kepunahan predator selalu tidak stabil, sedangkan titik koeksistensi kedua spesies bisa stabil dengan syarat tertentu. Karena adanya akar kuadrat, perilaku solusi di dekat titik kepunahan kedua spesies tidak mudah terlihat. Simulasi numerik menunjukkan bahwa perubahan nilai awal dan parameter dapat mengubah kestabilan sistem.Kata Kunci: predator prey; fungsi respons; perilaku bergerombol; fungsi respon akar kuadrat; model Leslie-Gower.
Application of Genetic Algorithm on Inclusive Labeling of a Graph Santoso, Kiswara Agung; Setiawan, Bagus Arief; Kusbudiono, Kusbudiono
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol 4, No 1 (2022)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v4i1.24327

Abstract

As science developed, heuristic methods began to be used in graph coloring. Heuristic methods that have been used for graph coloring include Genetic Algorithm, Tabu Search, and Ant Colony Algorithm. A Genetic Algorithm is a method for solving optimization problems. In this study, the Genetic Algorithm will be used for the issue of labeling irregular vertices of inclusive distances to label any graph inclusively. We restrict an inclusive 1-distance to a simple graph using one-point crossover and mutation. The steps are a generation of random chromosomes, evaluating chromosome fitness values with tournament selection, conducting an evolutionary process consisting of one-point crossover and mutation, repeating the process until the termination criteria are met. The results of implementing the genetic algorithm on inclusive labeling can be determined by the chromatic number based on the adjacency matrix. The results of this labeling can be used as an alternative solution to the problem of inclusive labeling.Keywords: Genetic Algorithm; graph labeling; inclusive labeling. AbstrakSeiring berkembangnya ilmu pengetahuan metode heuristic mulai digunakan dalam pewarnaan graf. Metode heuristic yang telah digunakan untuk pewarnaan graf antara lain Algoritma Genetika, Tabu Search, dan Algoritma Semut (Ant Colony). Algoritma Genetika merupakan metode untuk menyelesaikan masalah optimasi. Pada penelitian ini, Algoritma Genetika digunakan untuk masalah pelabelan titik tak-teratur jarak inclusive agar dapat melabeli sebarang graf secara inclusive. Kami membatasi lingkup penelitian dengan menerapkan jarak inclusive 1 pada graf sederhana, menggunakan crossover satu titik dan mutasi. Metode yang digunakan dalam penelitian ini adalah studi literatur dengan mengkaji penggunaan Algoritma Genetika pada pelabelan titik tak-teratur jarak inclusive suatu graf. Langkah-langkah yang dilakukan adalah: pembangkitan kromosom secara acak, evaluasi nilai fitness kromosom dengan tournament selection, melakukan proses evolusi yang terdiri dari crossover satu titik dan mutasi, perulangan proses sampai kriteria pemerhentian terpenuhi. Hasil implementasi algoritma genetika pada pelabelan inclusive adalah dapat mengetahui bilangan kromatik berdasarkan matriks adjacency. Hasil pelabelan ini dapat dijadikan sebagai salah satu alternatif penyelesaian masalah pelabelan inklusif.Kata Kunci : Algoritma Genetika; pelabelan graf; pelabelan inklusif.

Page 2 of 2 | Total Record : 13

 1   2 

Filter by Year

2022 2022


Reset
Filter By Issues
All Issue Vol 7, No 2 (2025) Vol. 7 No. 2 (2025) Vol 7, No 1 (2025) Vol. 7 No. 1 (2025) Vol 6, No 2 (2024) Vol. 6 No. 2 (2024) Vol. 6 No. 1 (2024) Vol 6, No 1 (2024) Vol 5, No 2 (2023) Vol. 5 No. 2 (2023) Vol. 5 No. 1 (2023) Vol 5, No 1 (2023) Vol. 4 No. 2 (2022) Vol 4, No 2 (2022) Vol 4, No 1 (2022) Vol. 4 No. 1 (2022) Vol. 3 No. 2 (2021) Vol 3, No 2 (2021) Vol 3, No 1 (2021) Vol. 3 No. 1 (2021) Vol 2, No 2 (2020) Vol 2, No 1 (2020) Vol 1, No 2 (2019) Vol 1, No 1 (2019) More Issue