Independent resolving sets in graphs
B. Suganya, S. Arumugam · AKCE International Journal of Graphs and Combinatorics · 2021
Let G=(V,E) be a connected graph. Let W={w1,w2,…,wk} be a subset of V with an order imposed on W. The k-vector r(v|W)=(d(v,w1),d(v,w2),…,d(v,wk)) is called the resolving vector of v with respect to W. The set W is called a resolving set if r(v|W)≠r(u|W) for any two distinct vertices u,v∈V. In this paper we investigate the existence of independent resolving sets in Cartesian product and corona of graphs.