Now showing items 1-1 of 1

    • Bound of Distance Domination Number of Graph and Edge Comb Product Graph 

      Gembong A.W; Slamin, Slamin; Dafik, Dafik; Agustin, Ika Hesti (2017-09-11)
      Let G =(V, E) be a simple, nontrivial, finite, connected and undirected graph. For an integer 1  k  diam(G), a distance k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V ...