BILANGAN DOMINASI−LOKASI PERSEKITARAN TERBUKA PADA GRAF TREE

ANDRIAN, RIKO (2016) BILANGAN DOMINASI−LOKASI PERSEKITARAN TERBUKA PADA GRAF TREE. Undergraduate thesis, UNDIP.

[img]
Preview
PDF
1079Kb
[img]PDF
Restricted to Repository staff only

1763Kb
[img]
Preview
PDF
71Kb

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.

Item Type:Thesis (Undergraduate)
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:84280
Deposited By:Admin Departemen Matematika
Deposited On:14 Jun 2022 09:06
Last Modified:14 Jun 2022 09:06

Repository Staff Only: item control page