Local Multiset Dimension of Amalgamation Graphs

Background: One of the topics of distance in graphs is the resolving set problem. Suppose the set W = { s ₁, s ₂, …, s _k } ⊂ V (G), the vertex representations of ∈ V (G) is r _m (x| W) = { d(x, s ₁), d(x, s ₂), …, 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)≠ r _m (u| W) for uv ∈ 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). Thus, if G has an infinite local multiset dimension and then we write (Formula presented.). Methods: This research is pure research with exploration design. There are several stages in this research, namely we choose the special graph which is operated by amalgamation and the set of vertices and edges of amalgamation of graphs; determine the set W ⊂ V (G); determine the vertex representation of two adjacent vertices in G; and prove the theorem. Results: The results of this research are an upper bound of local multiset dimension of the amalgamation of graphs namely md _l (Amal(G, v, m)) ≤ m. md _l (G) and their exact value of local multiset dimension of some families of graphs namely md _l (Amal(P _n, v, m)) = 1, (Formula presented.), md _l (Amal(W _n, v, m)) = m. md _l (W _n), md _l (Amal(F _n, v, m)) = m. md _l (F _n) for d(v) = n, (Formula presented.). Conclusions: We have found the upper bound of a local multiset dimension.