Analisis Konektivitas Graf pada Ayat - Ayat Al-Quran Menggunakan Minimum Spanning Tree dan Degree Centrality

Hirawati Lubis; Toriq Roziq

doi:10.25217/numerical.v9i2.6865

Authors

Hirawati Lubis Universitas Pamulang
Toriq Roziq Universitas Pamulang

DOI:

https://doi.org/10.25217/numerical.v9i2.6865

Keywords:

Degree centrality, Kruskal’s algorithm, Louvain community detection, Minimum spanning tree, Quranic thematic analysis

Abstract

This study aims to support the computational identification of Quranic themes through a graph theory–based approach. As a case study, the analysis focuses on verses discussing the virtues of the Quran within the framework of graph algorithm applications. The verses are modeled as a graph using an adjacency matrix to represent semantic connectivity between them. The thematic structuring process is conducted by constructing a Minimum Spanning Tree (MST) using the Kruskal Algorithm to obtain an optimal connectivity structure among vertices, followed by the application of Degree Centrality to identify structurally influential vertices corresponding to Quranic verses. The results demonstrate that the combined application of MST and Degree Centrality effectively visualizes the thematic structure of the verses and highlights verses with dominant structural roles in the context of Quranic virtues. Furthermore, the Louvain Algorithm is applied to detect thematic communities, revealing natural clustering patterns that contribute to a more systematic and interpretable thematic mapping. These findings contribute to the advancement of computational Quranic studies by reinforcing data-driven thematic analysis and structured graph-based representations.

References

Arslan, E., Turan, E., Tülü, N., Ç, & Orhan, U. (2020). A Comparison Of Graph Centrality Algorithms For Semantic Distance. ÇOMÜ LJAR, 1(2), 61–70. Website

Arul, S. M., Senthil, G., Jayasudha, S., Alkhayyat, A., Azam, K., & Elangovan, R. (2023). Graph Theory And Algorithms For Network Analysis. E3S Web Of Conferences, 399. https://doi.org/10.1051/e3sconf/202339908002

Badawy, A. A., Elhinawy, E., Salah, A., & Mahdi, M. A. (2024). Topic Discovery In The Digital Quran: A Text Mining Approach. Journal Of Information Systems Engineering And Management (Vol(ue 18s)). https://doi.org/10.52783/jisem.v10i18s.2976

Cheng, Y. Y., Lee, R. K. W., Lim, E. P., & Zhu, F. (2015). Measuring Centralities For Transportation Networks Beyond Structures. DOI:10.1007/978-3-319-19003-7_2

Fillah Arjuna, A. S. (2024). Nur Inayah, & Taufik Edy Sutanto. The Indonesian Journal Of Computer Science, 13(4). https://doi.org/10.33022/ijcs.v13i4.4170

Gallian, J. A. (2018). A Dynamic Survey Of Graph Labeling. The Electronic Journal Of Combinatorics. Website

Lakutu, N. F., Mahmud, S. L., Katili, M. R., & Yahya, N. I. (2023). Algoritma Dijkstra Dan Algoritma Greedy Untuk Optimasi Rute Pengiriman Barang Pada Kantor Pos Gorontalo. Euler : Jurnal Ilmiah Matematika, Sains Dan Teknologi, 11(1), 55–65. https://doi.org/10.34312/euler.v11i1.18244

Lubis, H., & Nuraini, S. (2024). Eksplorasi Pewarnaan Graf Dalam Identifikasi Destinasi Kuliner Menggunakan Algoritma Welch Powell Di Kota Serang. Jurnal Ilmiah Matematika Realistik (JI-MR, 5(2), 396–402. https://doi.org/10.33365/ji-mr.v5i2.5996

Lubis, H., & Srisulistiowati, D. B. (2021). Algoritma Prim Dan Kruskal Dalam Mencari Minimum Spanning Tree Pada Bahasa Pemrograman C. https://doi.org/10.35968/jsi.v8i2.711

Lubis, H., Sugeng, K. A., & Silaban, D. (2023). Bilangan Keterhubungan Pelangi Dan Keterhubungan Pelangi Kuat Pada Graf ⊙ Dan Graf ⊙ n. Jurnal Sains Dan Matematika Unpam, 5(2), 180–198. Website

Napitupulu, H., Carnia, E., Johansyah, M. D., Matematika, F., Ilmu, D., & Alam, P. (2020). Pengukuran Centrality Pada Graf Jaringan Serat Optik Palapa Ring Timur Ii. Http://Palaparing.Id/.

Nisrina, N. (2023). Analisis Centrality Dan Modularity Pada Graf Untuk Identifikasi Relasi Penelitian Indeks Topologi. Website

Rahimah, E., Yulianti, L., & Welyyanti, D. (2018). Penentuan Bilangan Kromatik Lokasi Graf Thron Dari Graf Roda W3. https://doi.org/10.25077/jmu.7.1.1-8.2018

Riyadi, S., Rozaanah, & Abdulghani, N. A. (2025). Integrasi Teknologi Dalam Pendidikan Islam: Tasqif. Journal Of Islamic Pedagogy, 2(2), 1–14. https://doi.org/10.51590/tsqf.v2i2.17

Shihab, M. Q. (2002). Tafsir Al-Mishbah : Pesan, Kesan Dan Keserasian Al-Qur'an. Lentera Hati.

Sholikhatin, S. A., Prasetyo, A. B., & Nurhopipah, A. (2020). Aplikasi Berbasis Desktop Untuk Penyelesaian Graph Dengan Algoritma Kruskal Dan Algoritma Prim. Rekayasa Sistem Komputer, 3(2), 89–93. Website

Sinlae, A. A. J., Nuraini, R., Alamsyah, D., & Riskiono, S. D. (2023). Implementasi Algoritma A* (A-Star) Dan Greedy Dalam Penentuan Routing Pada Wide Area Network (WAN. Journal Of Computer System And Informatics (Josyc, 4(3), 551–557. https://doi.org/10.47065/josyc.v4i3.3374

Syakir, S. A. (2012). Tafsir Ibnu Katsir Mukhtashar.

Talumewo, M. D., Sintiari, D. N. L., Novitaningrum, D., Dalimarta, F. F., Budianita, A., Ardiansyah, M., Thamrin, M., Jufri, L., H, & Supriyanto, F. B. (2025). Ebook Algoritma Dan Struktur Data. //Scholar.Google.Com/Scholar?Oi=Bibs&Cluster=8033417819547066229&Btni=1&Hl=Id.

Yasin, M., & Afandi, B. (2014). Simulasi Minimum Spanning Tree Graf Berbobot Menggunakan Algoritma Prim Dan Algoritma Kruskal. Eucazione, 2(ue 2)). Website