Now showing items 1-2 of 2

    • 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 ...
    • On Rainbow k-Connection Number of Special Graphs and It's Sharp Lower Bound 

      Agustin, Ika Hesti; Dafik, Dafik; Gembong A.W (2018-02-28)
      Let G = (V; E) be a simple, nontrivial, nite, connected and undirected graph. Let c be a coloring c : E(G) ! f1; 2; : : : ; sg; s 2 N. A path of edge colored graph is said to be a rainbow path if no two edges on the ...