Penerapan Pewarnaan Graf Menggunakan Algoritma Welch Powell Pada Penempatan Kamar Mahasiswa (Studi Kasus : Asrama F Universitas Islam Darul ‘Ulum)

  • Agus Mutia Universitas Islam Darul 'ulum Lamongan
  • Siti Amiroch Universitas Islam Darul 'ulum Lamongan
Keywords: Graph coloring, Welch-Powell algorithm, Room allocation, Graph theory, Student dormitory

Abstract

The allocation of student dormitory rooms often faces potential conflicts if not managed properly, especially when students from the same study program are assigned to the same room. This study aims to optimize the room assignment of students in Dormitory F at Universitas Islam Darul ‘Ulum by applying graph theory, specifically graph coloring using the Welch-Powell algorithm. Each student is represented as a vertex, and edges connect students from the same study program, indicating they should not share a room. The Welch-Powell algorithm colors the graph by ordering vertices in descending order of degree and assigning colors so that no two adjacent vertices share the same color. The results show that 14 students from 8 different study programs were successfully grouped into 4 rooms, ensuring no students from the same program share a room. This method effectively reduces potential conflicts, fosters an inclusive and heterogeneous dormitory environment, and broadens inter-program student interactions. The approach provides a practical solution for dormitory management to arrange room assignments efficiently and harmoniously.

References

[1] A. Oxley, Discrete mathematics and its applications, vol. 29, no. 3. 2010. doi: 10.1093/teamat/hrq007.
[2] J. Beno, A. . Silen, and M. Yanti, “Sistem Informasi Penjadwalan Ujian Online Pada Penerimaan Peserta Didik Baru Menggunakan Algoritma Welch-Powell,” Braz Dent J., vol. 33, no. 1, pp. 1–12, 2022.
[3] S. Amiroch and E. E. Andini, “Pewarnaan Titik Pada Graf Untuk Penyusunan Menu Makanan,” J. UJMC, vol. 2, pp. 56–61, 2016.
[4] P. S. Wicaksono and K. Kartono, “Analisis Penjadwalan Mata Pelajaran Menggunakan Algoritma Welch-Powell,” Prism. J. Pendidik. dan Ris. Mat., vol. 3, no. 1, pp. 1–21, 2020, doi: 10.33503/prismatika.v3i1.1008.
[5] U. Maftukhah, S. Amiroch, and M. S. Pradana, “Implementasi Algoritma Greedy Pada Pewarnaan Wilayah Kecamatan Sukodadi Lamongan,” vol. 6, pp. 29–38.
[6] M. Qomaruddin, W. Bismi, and D. Hariyanto, “Pewarnaan Graf Pada Peta Provinsi Jawa Barat Menggunakan Algoritma Welch-Powell,” J. Sist. dan Teknol. Inf., vol. 10, no. 2, p. 258, 2022, doi: 10.26418/justin.v10i2.53829.
[7] S. Amiroch, H. Chang, M. Jamhuri, and T. Yulianto, “Vertex Coloring in Graphs: A Novel Approach to Nutritional Menu Planning,” AIP Conf. Proc., vol. 3176, no. 1, 2024, doi: 10.1063/5.0225769.
[8] R. K. Harahap and N. Khairani, “Penerapan Pewarnaan Graf dalam Penjadalan Kerja Menggunakan Algoritma Welch-Powell (Studi Kasus: Rumah Sakit Grand Medistra Lubuk Pakam),” Innov. J. Soc. Sci. Res., vol. 4, no. 2, pp. 1–12, 2024.
[9] K. A. Rahmani, Y. Setyaningsih, S. N. Anjarwati, and M. S. Wafa, “Penerapan Pewarnaan Graf Pada Penempatan Kamar Mahasiswa (Studi Kasus : Ma ’ Had Al - Jami ’ Ah Universitas Islam Negeri Salatiga ),” vol. 2, no. 1, pp. 48–55, 2024.
[10] T. Utomo and N. Riskiana Dewi, “Dimensi Metrik Graf Amal(nKm),” Limits J. Math. Its Appl., vol. 15, no. 1, p. 71, 2018, doi: 10.12962/limits.v15i1.3376.
[11] I. Arthalia Wulandari and P. Sukmasetyan, “Implementasi Algoritma Dijkstra untuk Menentukan Rute Terpendek Menuju Pelayanan Kesehatan,” J. Ilm. Sist. Inf., vol. 1, no. 1, pp. 30–37, 2022, doi: 10.24127/jisi.v1i1.1953.
Published
2025-06-30
How to Cite
Mutia, A., & Amiroch, S. (2025). Penerapan Pewarnaan Graf Menggunakan Algoritma Welch Powell Pada Penempatan Kamar Mahasiswa (Studi Kasus : Asrama F Universitas Islam Darul ‘Ulum). UJMC (Unisda Journal of Mathematics and Computer Science), 11(1), 103-109. https://doi.org/https://doi.org/10.52166/ujmc.v11i1.10547

Most read articles by the same author(s)