Article Per Year (5 Year)
p-Index From 2021 - 2026
3.546
P-Index
This Author published in this journals
All Journal JURNAL PIJAR Journal of the Indonesian Mathematical Society Science and Technology Indonesia Beta: Jurnal Tadris Matematika Jurnal Pengabdian Magister Pendidikan IPA EIGEN MATHEMATICS JOURNAL Jurnal Matematika UNAND Jurnal Teknodik Jurnal Abdi Insani Square : Journal of Mathematics and Mathematics Education JPIn : Jurnal Pendidik Indonesia SPEKTA (Jurnal Pengabdian Kepada Masyarakat : Teknologi dan Aplikasi) Jurnal Ilmiah Abdi Mas TPB Unram Prosiding Konferensi Nasional PKM-CSR Jurnal Pijar MIPA Jurnal Pariwisata Nusantara Jurnal Pendidikan dan Pengabdian Masyarakat Jurnal Pengabdian Inovasi Masyarakat Indonesia Sinergi dan Harmoni Masyarakat MIPA
Mamika Ujianita Romdhini
Fakultas Matematika Dan Ilmu Pengetahuan Alam, Universitas Mataram
Agriculture, Biological Sciences & Forestry Humanities Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Energy Engineering Environmental Science Health Professions Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Mathematics Nursing Physics Public Health Social Sciences Other

Published : 48 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 48 Documents
Search

 1   2   3   4   5 
INDEKS WIENER PADA GRAF KOPRIMA PRIMA DARI GRUP BILANGAN BULAT MODULO Abdurahim Abdurahim; LIA FITTA PRATIWI; GUSTI YOGANANDA KARANG; I GEDE ADHITYA WISNU WARDHANA; MAMIKA UJIANITA ROMDHINI
Jurnal Matematika UNAND Vol. 15 No. 2 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

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

Abstract

Graf Koprima Prima merupakan graf yang mana sebarang dua simpul berbeda dikatakan bertetangga jika dan hanya jika Faktor Persekutuan terbesar (FPB) dari order kedua simpul sama dengan 1 atau prima. Penelitian ini bertujuan untuk mengkaji subgraf serta rumus umum dari indeks Wiener dan Hyper-Wiener pada graf koprima prima dari grup bilangan bulat. Dari penelitian ini didapatkan bahwa subgraf yang terbentuk adalah graf lengkap dan bipartit. Selain itu, diperoleh juga rumus umum indeks Wiener dan Hyper-Wiener. Lebih jauh, nilai dari indeks Hyper-Wiener kurang dari dua kali indeks Wiener.
Comparative Analysis of Bellman-Ford and Dijkstra Algorithms to Determine the Shortest Tourist Path in Central Lombok Krissinta Bulan Wardhani; Gusti Yoga Nanda Karang; Septi Fajria; Muhammad Imam Al Paqih; Rida Akausar Hardi; M. Setyo Nugroho; Mamika ujianita Romdhini
Jurnal Pariwisata Nusantara (JUWITA) Vol. 4 No. 1 (2025): Jurnal Pariwisata Nusantara (JUWITA)
Publisher : PROGRAM STUDI PARIWISATA SYARAH, FAKULTAS EKONOMI DAN BISNIS ISLAM, UNIVERSITAS ISLAM NEGERI MATARAM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20414/juwita.v4i1.13155

Abstract

Purpose: Central Lombok Regency has many tourist attractions spread out, which often makes it difficult for tourists to determine the best travel route to visit several locations at once. Choosing the shortest route is an important factor because it can save time, energy, and fuel costs, especially in tourist trips with unstructured schedules. Therefore, an effective method is needed to determine the shortest route to improve the efficiency of tourist trips. This study analyzes the shortest route to tourist attractions in Central Lombok Regency using two popular graph algorithms, including Dijkstra Algorithm and Bellman-Ford Algorithms Method: In this study, the data used are 6 tourist attractions in Central Lombok Regency. Tourist attractions are represented by points on the graph. Then the edge represents the road connecting the tourist attractions and the weight represents the distance to each tourist attraction from a starting point. Then to determine the minimum shortest distance of each tourist attraction based on the graph, Dijkstra and Bellman-Ford algorithms are used. Result: The shortest path to tourist attractions in Central Lombok Regency is obtained based on the Dijkstra and Bellman-Ford Algorithms. Contribution: Through this analysis, the advantages and disadvantages of the two algorithms in the context of determining tourist routes in Central Lombok can be identified.
Optimizing Shuttle Bus Paths at Mandalika Circuit with Dijkstra Algorithm to Support MotoGP Sport Tourism Krissinta Bulan Wardhani; Rabbelia Tri Qudrani; Nafika Fatanaya; Ririn Maulidia; Sarwa Hita; M. Setyo Nugroho; Mamika Ujianita Romdhini
Jurnal Pariwisata Nusantara (JUWITA) Vol. 4 No. 3 (2025): Jurnal Pariwisata Nusantara
Publisher : PROGRAM STUDI PARIWISATA SYARAH, FAKULTAS EKONOMI DAN BISNIS ISLAM, UNIVERSITAS ISLAM NEGERI MATARAM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20414/juwita.v4i3.14699

Abstract

Purpose: MotoGP is one of the most popular motorcycle racing events in terms of sport and recreation around the world. To get to the MotoGP venue we have to go through several routes. This route problem can disrupt visitor mobility, make them uncomfortable, and even damage the reputation of the international event. This study aims to develop a system for determining the shortest route for shuttle buses at the Mandalika Circuit by utilizing the Dijkstra algorithm. Method: To determine the shortest route we use an algorithm, one of which is the Dijkstra algorithm. The Dijkstra algorithm is one of the most well-known algorithms for finding the shortest route on a graph network. It can efficiently find the path with the minimum weight from one vertex to another. Result: The results of this study using the manual method with the contribution of the Dijkstra algorithm both produced 5 shortest routes with 2 routes in the green zone, 2 routes in the blue zone and 1 route in the red zone. Contribution: Through this analysis, a solution can be formulated for the shuttle bus route at the Mandalika Circuit in order to support sustainable MotoGP motorcycle racing tourism.
Zagreb-Based Indices of Line Graph of Prime Coprime Graph for Integers Modulo Group Abdurahim; Mamika Ujianita Romdhini; Jihadil Qudsi
Science and Technology Indonesia Vol. 11 No. 3 (2026): July
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/sti.2026.11.3.844-854

Abstract

In this paper, we investigate the line graph of the prime coprime graph associated with the integers modulo group. Explicit general formulas are derived for the first Zagreb index, the second Zagreb index, and the hyper-Zagreb index of the considered structures. A comparative analysis is performed between the newly obtained results and previously reported findings, highlighting structural differences and index growth behaviour under the line-graph transformation. Furthermore, a statistical analysis is conducted to explore the quantitative relationship between the prime coprime graph and its corresponding line graph with respect to the computed Zagreb-based indices. The results provide deeper insight into the structural complexity of algebraically defined graphs and clarify how degree-based topological descriptors evolve under graph transformations.
Implementasi Algoritma IDA* (Iterative Deepening A*) Dalam Menentukan Solusi Terbaik Pada Permainan Othello Dengan Simulasi MATLAB Halilintar Nur Hidayatullah; Mamika Ujianita Romdhini; Irwansyah Irwansyah
Eigen Mathematics Journal Vol 1 No 1: Vol 1 No 1 Juni 2018
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (318.203 KB) | DOI: 10.29303/emj.v1i1.1

Abstract

Permainan  Othello  adalah  permainan  logika  asal  jepang.  Permainan  ini dimainkan oleh dua orang pada papan persegi dengan bidak hitam dan bidak putih. Dibutuhkan strategi yang jitu untuk meraih kemenangan, sehingga pada penelitian ini memiliki 2 tujuan, pertama untuk menganalisis langkah-langkah yang akan ditentukan menggunakan algoritma IDA* (Iterative Deepening A*) yang dinotasikan sebagai 𝑓(𝑛) = 𝑔(𝑛) + ℎ(𝑛) dengan 𝑔(𝑛) adalah jumlah langkah dari simpul  awal  menuju  simpul  n  dengan  m  jumlah  simpul,  dan  ℎ(𝑛)  adalah  jarak perkiraan  dari  simpul  n  menuju  simpul  tujuan.  Kedua  didapatkan  hasil  simulasi berdasarkan pemrograman MATLAB.Pada program simulasi ini digunakan matriks ukuran 6 × 6 dengan simbol 1, 2,  dan  0  yang  masing-masing  merepresentasikan  bidak  hitam,  bidak  putih,  dan kotak  yang masih kosong.  Dengan salah satu solusi  yang didapat pada program adalah hitam (9), putih (20), hitam (26), putih (10), hitam (11), putih (17), hitam (23),  putih (27), hitam (8), putih (6), hitam (12), putih (14), hitam (33), putih (28), hitam (29), putih (31), hitam (25), putih (30), hitam (7), putih (2), hitam (18), putih (13), hitam (19), putih (36), hitam (35), putih (1), hitam (3), putih (34), hitam (32), putih (4), hitam (5), putih (24). Dengan bobot  -min pada tiap iterasi 14, 15, 16, 17, 20, 15, 16, 18, 15, 16, 18, 17, 13, 14, 15, 16.
Analisis Keberhinggaan Matriks Representasi atas Grup Berhingga Muhammad Taufan; Mamika Ujianita Romdhini; Ni Wayan Switrayni
Eigen Mathematics Journal Vol 1 No 1: Vol 1 No 1 Juni 2018
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (364.442 KB) | DOI: 10.29303/emj.v1i1.10

Abstract

Representation of a finite group G over generator linear non singular mxm matrix with entries of field K defined by group homomorphismA : G → GLm(K)Basically, the non singular mxm matrix A(x) which representing the finite group G divided into two, that are the unitary matrix and non unitary matrix . If A(x) is a non unitary matrix, then there exist a unitary matrix which similar to A(x). This research deals to analyze the numbers of one example of a unitary matrix representation over arbitrary finite group G with order n that is permutation matrix, and the number of unitary matrix which is similar to real non unitary matrix representation of arbitrary finite group G order 2. The results showed the numbers of permutation matrix representation is n! and unitary matrix which is similar to non unitary matrix representation is 2.
Analisis Automorfisma Graf Pembagi-nol dari Ring Komutatif dengan Elemen Satuan Kurniawan Sugiarto; Mamika Ujianita Romdhini; Ni Wayan Switrayni
Eigen Mathematics Journal Vol 1 No 1: Vol 1 No 1 Juni 2018
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (332.712 KB) | DOI: 10.29303/emj.v1i1.11

Abstract

Zero-divisor graphs of a commutative ring with identity has 3 specific simple forms, namely star zero-divisor graph, complete zero-divisor graph and complete bipartite zero-divisor graph. Graph automorphism is one of the interesting concepts in graph theory. Automorphism of  graph G is an isomorphism from graph G to itself. In other words, an automorphism of a graph G is a permutation φ of  the set points V(G) which has the property that (x,y) in E(G)  if and only if (φ(x),φ(y)) in E(G), i.e. φ preserves adjacency.This study aims to analyze the form of zero-divisor graph automorphisms of a commutative ring with identity formed. The method used in this study was taking sampel of each zero-divisor graph to represent each graph. Thus, pattern and shape of automorphism of each graph can be determined. Based on the results of this study, a star zero-divisor graph with pattern K_1,(p-1), where p is prime, has (p-1)! automorphisms, a complete zero-divisor graph with pattern K_(p-1), where p is prime, has (p-1)!  automorphisms, and a complete bipartite zero-divisor graph with pattern K_(p-1),(q-1), where p is prime, has (p-1)!(q-1)! automorphisms, when p not equals to q  and 2((p-1)!(q-1)!) automorphisms  when p=q.
Modifikasi Algoritma Kriptografi Hill Chiper dengan Matriks Generalisasi Bilanga Fibonacci dalam Penyandian Pesan Husni Fitroti; Mamika Ujianita Romdhini; Ni Wayan Switrayni
Eigen Mathematics Journal Vol. 4 No. 2 Desember 2021
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/emj.v4i2.107

Abstract

Hill Cipher algorithm is a technique of message encoding by implementing a matrix of order  as a key matrix. The key matrix is a matrix that has a multiplicative inverse. The security of message is measured by the number of processes in encoding. The more processes in encoding the longer time it takes. Consequently, the massage will be more secure. The purpose of this research is to modify the Hill Cipher algorithm by using generalized Fibonacci matrix  whose degree-p  and rank-n . This research showed that for any non-negative integer p and positive integer n, matrix  can be used as a key matrix in Hill Cipher algorithm. The modification of the Hill Cipher algorithm has been done by modifying the former key by making the degree and rank of  as the key used in the encryption and decryption process of data (message).
Co-Authors Abdul Azis Lalu Mursy Abdurahim Abdurahim, Abdurahim Ahmad Tedi Ruslan Al-Quran, Ashraf Al-Sharqi, Faisal Awanis, Zatta Yumni Ayes Malona Siboro Baldovini, Nicolas Borisman Bertinegara Davina Puspa Ningrum Devi Lastri Dhony Hermanto Diah Ayu Saptyaningtyas Dira Agnita Putri Widodo Dwi Yan Resilia Dzakiyatul Mardliyah Ermawati Sapni ERNIN HIDAYATI Fahmi Handika Fariz Maulana Farwan Farwan Farwan, Farwan Fathul Maulina Wahidah Ghina Briliana Fatin Octariana Graha, Syifa Salsabila Satya Gusti Yoga Nanda Karang Gusti Yogananda Karang Gusti Yogananda Karang Halilintar Nur Hidayatullah Hermanto, Koko Hibban Kholiq Hibban Kholiq Husni Fitroti I Gede Adhitya Wisnu W. I Gede Adhitya Wisnu Wardhana I Gede Adhitya Wisnu Wardhana I Gede Adhitya Wisnu Whardana Irwansyah - Irwansyah Irwansyah Irwansyah Irwansyah Irwansyah Irwansyah Irwansyah Irwansyah Ito, Michiho Jihadil Qudsi Julisaniah, Nur Indah Karang, Gusti Yogananda Krissinta Bulan Wardhani Kurniasih Sukenti Kurniawan Sugiarto Laila Hayati Laila Hayati, Laila Lailia Awalushaumi Lalu Djatmika Santriawan Lalu Riski Wirendra Putra Lely Kurniawati Lely kurniawati Lena Yuliastini Lia Fitta Pratiwi Lia Fitta Pratiwi M. Afdhaluzzikri M. Setyo Nugroho Maharani, Andika Ellena Saufika Hakim Mariana, Baiq Marliadi Susanto Marliadi Susanto Marwan Marwan Maulana, Fariz Mira Sulisdiana Muhammad Imam Al Paqih Muhammad Khairurradziqin Muhammad Taufan Muktasam Mustika Hadijati Nadia W Nadia, Ahsanu Nafika Fatanaya Nawawi, Athirah Ni Wayan Switrayni Nora Idiawati Nurkurnia Sari Nurul Ismillayli Parizal Hidayatullah Pradana, Satriawan Pratama, Rendi Bahtiar Pratiwi, Lia Fitta Puguh Riawang Puspita Dewi, Chandra Putra, Lalu Riski Wirendra Putri, Syaftirridho Qomaria Sinta Sari Qudsi, Jihadil Rabbelia Tri Qudrani Raden Mohammad Akbar Rafi Raehanatul Mardiyah Rahman, Muhammad Rizki Rendi Bahtiar Pratama Rida Akausar Hardi Rina Juliana Rio Satriyantara Ririn Maulidia Rizki Faturrahman Rodzi, Zahari Md. Rossy Jamalul Hoir Ruru Honiar Saprini Hamdiani Sarwa Hita Satriawan Pradana Septi Fajria Siboro, Ayes Malona Siti Rahmatullah Siti Raudhatul Kamali Siti Raudhatul Kamali Sunarwidhi , Anggit Listyacahyani Surya Hadi Surya Hadi Syaftirridho Putri Syifa Salsabila Satya Graha Takamatsu, Sakura Teguh Ardianto, Teguh Tri Mulyaningsih Ulul Khairi Zuryati Wahidah, Fathul Maulina Wahyu Ulfayandhie Misuki Wardhana, I Gede Adhiya Wisnu Wirahadi, Ahmad Yanagisawa, Masayuki Yumi, Fujiwara Zata Yumni Awanis Zata Yumni Awanis