Now showing items 1-1 of 1

    • On The Metric Dimension with Non-isolated Resolving Number of Some Exponential Graph 

      YUNIKA, S.M.; SLAMIN, Slamin; DAFIK, Dafik; KUSBUDIONO, Kusbudiono (Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
      Let w, w ∈ G = (V, E). A distance in a simple, undirected and connected graph G, denoted by d(v, w), is the length of the shortest path between v and w in G. For an ordered set W = {w1, w2, w3, . . . , wk} of vertices and ...