Now showing items 1-1 of 1

    • Non-Isolated Resolving Number of Graph with Pendant Edges 

      Alfarisi, Ridho; Dafik, Dafik; Kristiana, Arika Indah; Agustin, Ika Hesti (2019-07-25)
      We consider V; E are respectively vertex and edge sets of a simple, nontrivial and connected graph G. For an ordered set W = fw g of vertices and a vertex v 2 G, the ordered r(vjW) = (d(v; w 1 ); d(v; w 2 1 ; w 2 ; ...