Please use this identifier to cite or link to this item:
https://repository.unej.ac.id/xmlui/handle/123456789/99375
Title: | Resolving Domination Numbers of Family of Tree Graph |
Authors: | MARDIYA, Regita Triani KRISTIANA, Arika Indah DAFIK, Dafik |
Keywords: | Resolving Numbers Domination Numbers Resolving Domination Numbers Family of Tree Graph |
Issue Date: | 9-Jan-2020 |
Publisher: | International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 27-30 |
Abstract: | All graph in this paper are members of family of graph tree. Let G is a connected graph, for an ordered set W={w1,w2,...,wk} of vertices and a vertex which is not element of W, then W is dominating set of graph G when the vertices that are not listed at W are vertices which are adjacent with W. The minimum cardinality of dominating set of graph G is called dominating numbers denoted G . If W and a vertex on graph G are connected each other, the metric representation of v which is element of W is the k-vector r(v|W)=(d(v,w1), d(v,w2),..., d(v,wk)), where d(x,y) represents distance between x and y. Then, W is resolving dominating set of graph G if the distance of all vertices is different respect to W. The minimum cardinality of resolving dominating set is called resolving domination numbers denoted (G ) r . In this paper we found the exact values of resolving dominating for firecracker graph, caterpillar graph and banana tree graph. |
URI: | http://repository.unej.ac.id/handle/123456789/99375 |
Appears in Collections: | LSP-Jurnal Ilmiah Dosen |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
F. KIP_Jurnal_Arika Indah K_Resolving Domination Numbers of Family of Tree Graph.pdf | 194.17 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.