Some Results on Non-Isolated Resolving Number

Abstract

Connected graphs G. W = {w1, w2,..., wk} is a subset of V with a predetermined order. The line vector r(v|W) = (d(v, w1), d(v, w2),..., d(v, wk)) is the measurement depicting v with regards to W for each v ∈ V. If V's vertex utilize various metrics, W resolves G. Their fundamental magnitude, dim(G), is their lowest cardinality. A resolved set W is non-isolated if its influenced subsection ⟨W ⟩ has no single vertex. The simplest connection of a non-isolated resolved set of G is nr. An nr-set for G is a non-isolated resolution set of cardinality nr(G). In this study, we prove that the chart G has a unique nr-set. We also build a 2n-vertex graph G using nr-set. W which means nr(G) = n and r(vi|W) = (1,...2, 1), where 2 is in the ith location, represents every vertex not in W. Further we established the nr-value for the highly irregular graph Hn,n and for the Wheel Wn. Also we determined the nr-value for corona product of some graphs.