Minimizing The Development of Lake at River Meeting Points to Reduce Floods in Jakarta Using the Dominating Set Application
One of the theories developed in graph theory is the dominating set. Dominating set is a concept of determining the minimum point on the graph with the provision of a point as dominating set to reach the point that is around it. The smallest cardinality of the dominating set is called the domination number denoted by (G). Given graph G with point V and E side, let D be a subset of V. If each point of VD is adjacent at least one point from D, then D is said dominating set in graph G. Currently a lot of applications from dominating set, one of which is Minimizing the Construction of Lakes at River Meeting Points to Reduce Floods in Jakarta. In this study a river meeting will be rebuilt to select floods in Jakarta. Flooding is a natural disaster which is currently often in Indonesia. Especially in Jakarta. Jakarta is one of the risk areas for flooding in Indonesia and floods that always occur suddenly There are so many ways to reduce them, but that doesn't work. One of the causes of flooding in Jakarta is the overflow of river air. When a patient appears suddenly several rivers that have large currents, air flow will collide at the meeting point. When the river flows, the air will overflow large enough. Therefore, it is important to develop a lake at the river meeting point but it is necessary to make the lake as minimal as possible and also to be efficient. The research application dominates the set of lake developments in each river meeting point in the city.
Keywords: dominating set, river, flood
Agustin I.H. dan Dafik (2014). On the domination number of some families of special graphs. prosiding seminar matematika dan pendidikan matematika unversitas jember.1(1).
Alfarisi.R., Dafik. dan Fatahillah.analisa himpunan dominasi pada graf-graf khusus. prosiding seminar matematika dan pendidikan matematika unversitas jember.1(1).
Da?k, Structural Properties and Labeling of Graphs, University of Ballarat,2007.
Harrary. F. (2007).Graph Theory.Addison:Wesley.
Hayness,T.W.,Hedetniemi,S.T., and Slater,P.J,.(1998).Fundamentals of domination in Graph.New York:Marcel Dekker.
Hayness,T.W., and Henning,M.A,.(2002).Total Domination good vertices in graphs.Australasian Journal of combinatoric, page 305-315.
Joseph A. Gallian, A Dynamic Survey of Graph Labeling, University of Minnesota, 1997.
Kavitha dan Govindarajan, A Study on Achromatic Coloring Graphs and its Applications, Dravidian University. ISSN: 2319-7064. 105-108, 2013.
Lu. H, Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights, Xian Jiaotong University, 2013.
Micha l Karonski, Tomasz Luczak, and Andrew Thomason, Edge Weights and Vertex Colours, Journal of Combinatorial Theory, Series B, 91:151157, 2004.
https://www.petajakarta.net/tempat-sungai-di-jakarta/ (akses 11 november 2017)
How to Cite
Copyright (c) 2019 JURNAL AXIOMA : Jurnal Matematika dan Pembelajaran
This work is licensed under a Creative Commons Attribution 4.0 International License.