Browsing LECTURER SCIENTIFIC PUBLICATION (Publikasi Ilmiah) by Subject "domination number"
Now showing items 1-3 of 3
-
On locating independent domination number of amalgamation graphs
(2018-02-28)An independent set or stable set is a set of vertices in a graph in which no two of vertices are adjacent. A set D of vertices of graph G is called a dominating set if every vertex u 2 V (G) ¡ D is adjacent to some vertex ... -
On The LDS of the Joint Product of Graphs
(2019-09-02)Locating dominating set (LDS) is one of the topics of graph theory. A set VD of vertices in graph G is called a dominating set if every vertex V u is either an element of D or adjacent to some element ... -
Resolving Domination Number of Graphs
(Discrete Mathematics, Algorithms and Applications, Vol. 11, No. 6 (2019) 1950071, 2019-11-05)For a set W = { s1,s2,...,sk of vertices of a graph G, the representation multiset of a vertexv of G with respect to W is r(v | W ) = { d(v, s1),d(v, s2),...,d(v, sk) } , where d(v, si) is a distance between of ...