Local multiset dimension of corona product on tree graphs

One of the topics of distance in graphs is resolving set problem. This topic has many applications in science and technology namely navigation robots, chemistry structure, and computer sciences. Suppose the set W = {s(1), s(2), . . . , s(k)} subset of V (G), the vertex representations of x is an element of V (G) is r(m) (x|W) = {d(x, s(1)), d(x, s(2)), . . . , d(x, s(k))}, where d(x, s(i)) is the length of the shortest path of the vertex x and the vertex in W together with their multiplicity. The set W is called a local m-resolving set of graphs G if r(m) (v|W) not equal r(m) (u|W) for uv is an element of E(G). The local m-resolving set having minimum cardinality is called the local multiset basis and its cardinality is called the local multiset dimension of G, denoted by md(l) (G). In our paper, we determine the establish bounds of local multiset dimension of graph resulting corona product of tree graphs.