Application of the Domination Set Concept in Graph Theory for Optimizing the Number of Drinking Water Pipes Leaks in Mausamang Village, East Alor District

  • Landerius Maro Universitas Tribuana Kalabahi


Regional development is one of the problems that are often faced by PDAM. The development of the area is the development of a water pipe distribution network. The more people there are, the more people will find it difficult to get optimal drinking water because they leak it without thinking about other peoples. As an example of the problem of regional development, there are several areas that have not received water from PDAM, this shows that the distribution of clean water isn’t optimal. In an effort to overcome these problems, an action is needed to optimize the pipe leaks. The purpose of this study is to minimize the leaks of the primary pipe by using the concept of applying the domination set of graph theory. The research steps carried out by researchers include data collection, determining the domination set, and distribution of drinking water pipelines. The comparison of the total initial primary pipe leaks points is 80 points that dominate 117 house points and by minimizing the primary pipe leaks by applying the concept of the domination set to 44 points that dominate 117 house points there is a reduction of 36 primary pipe leaks points that will be closed. The data concludes that the concept of the domination set on the graph can be used to find the optimal network in the PDAM water distribution network.


Download data is not yet available.


Anonymus. 2010. buahku: Tanaman Buah dan manfaatnya. /2010/09/20/tanaman-pala/. 28 Oktober 2012

Chartrand, G., Oellermann, O. R.1993. Applied and Algorithmic Graph Theory. McGraw- Hill, Inc.

Chartrand, G., Lesniak, L. 1996. Graphs and DigraphThird Edition. Chapman and Hall/CRC, London– New York–Washington, D.C.

Darmaji. 2011. Dimensi Partisi Graf Multipartit Dan Graf Hasil Korona Dua Graf Terhubung.Bandung. Institut Teknologi Bandung

Haynes, T. W., Hedetniemi, S. T., Slater, P. J. 1998. Fundamentals of Domination in Graphs. Marcel. Dekker , Inc, New York-Basel-Hong Kong.

Mahfudhi, Muhammad Ghufron. 2010. Penerapan Algoritma Dijkstra pada Link State Routing Protocol untuk Mencari Jalur Terpendek. Makalah IF3051 Strategi Algoritma – Sem. I Tahun 2010/2011. Institut Teknologi Bandung. Bandung.

Munir, Rinaldi. 2005. Diktat Kuliah Strategi Algoritmik.Departemen Teknik Intermatika Ore, O. 1962. Theory of Graph. American Mathematical Society Colloquium Publications Vol. XXXVIII, United States of American.

Rofiah, M., Dafik 2014. Kajian himpunan dominasi pada graf khusus dan operasinya. ProsidingSeminar Matematika dan Pendidikan Matematika Universitas Jember. 1 : 191–196.

Siang, Jong Jek. 2011. Riset Operasi Dalam Pendekatan Algoritmis. Penerbit Andi.Yogyakarta.

Siang, Jong Jek. 2002. Matematika Diskrit dan Aplikasinya pada Ilmu Komputer.Yokyakarta: Andi offset.

Sudjana, Nana, dan Ibrahim. 1989. Penelitian kualitatif dan kuantitatif. Bandung: Sinar Baru .

Sugiyono. 2013. Metode Penelitian Pendidikan Pendekatan Kuantitaif, Kualitatif, dan R&D. Bandung:Alfabeta.
How to Cite
Maro, L. (2022). Application of the Domination Set Concept in Graph Theory for Optimizing the Number of Drinking Water Pipes Leaks in Mausamang Village, East Alor District. Jurnal Saintek Lahan Kering, 4(2), 16-18.
Original research article