Rabbelia Tri Qudrani
Universitas Mataram

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

Found 2 Documents
Search

COMPUTATIONAL ANALYSIS OF TOPOLOGICAL INDICES ON POWER GRAPHS OF MODULO PRIME POWER GROUPS USING PYTHON Rabbelia Tri Qudrani; Tri Maryono Rusadi; I Gede Adhitya Wisnu Wardhana; Abdul Gazir Syarifudin
MATHunesa: Jurnal Ilmiah Matematika Vol. 13 No. 3 (2025)
Publisher : Universitas Negeri Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26740/mathunesa.v13n3.p459-465

Abstract

This study uses Python to calculate and analyze three indices such as the first Zagreb, Wiener, and Gutman indices on the rank graph of the group modulo the power of a prime number. It relies on formulas that have been developed by previous research. By using Python libraries such as NetworkX, Matplotlib, and Tkinter, the calculation process becomes more efficient and allows visualization of index variations based on changes in the values of prime p and exponent k. The results show that the values of the three indices increase as the values of p and k increase, reflecting the increasing complexity of the graph structure. At large values of p and k, the graph visualization is too complex which causes the graph visualization to be less clear. This approach proves to be effective in supporting visual and quantitative exploration of algebraic structures.
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.