The non-isolated resolving number of k-corona product of graphs

Let all graphs be a connected and simple graph. A set W = {w(1), w(2), w(3),..., wk} of veretx set of G, the k-vector ordered r(v vertical bar W) = (d(x,w(1)), d(x,w(2)),..., d(x,w(k))) of is a representation of v with respect to W, for d(x,w) is the distance between the vertices x and w. The set W is called a resolving set for G if different vertices of G have distinct representation. The metric dimension is the minimum cardinality of resolving set W, denoted by dim(G). Through analogue, the resolving set W of G is called non-isolated resolving set if there is no for all v is an element of W induced by non-isolated vertex. The non-isolated resolving number is the minimum cardinality of non-isolated resolving set W, denoted by nr(G). In our paper, we determine the non isolated resolving number of k-corona product graph.