BILANGAN DOMINASI−LOKASI PERSEKITARAN TERBUKA PADA GRAF TREE

Abstract

Set subset ofvertex set is called dominating set if each vertex of is adjacent to at least one vertex in . A dominating set in the graph is an open neighborhood locating-dominting set for if for two vertice of the set and are non-empty and different. The open neighborhood locating-dominating number of a graph denoted is the cardinality of a minimum open neighborhood locating-dominting set. This final project we study about open neighborhood locating-dominating set in graph tree. Graph tree of order have open neighborhood locating-dominating number ⌈ ⁄ ⌉ . Keywords: open neighborhood locating-dominting set, open neighborhood locating-dominating number.