Keywords
local m-resolving set; local multiset dimension; amalgamation graph.
local m-resolving set; local multiset dimension; amalgamation graph.
We have revised the introduction section for local multiset dimension notation, namely \mu(G) to md_l(G). I have revised the \Pi notation for the example to W. The notation for Figure v_0 has been revised according to the reviewer's suggestions. Writing errors have been revised according to grammar. The dot notation v has been changed to u according to the definition of the amalgamation, there is no v notation. All references have been cited in the introduction. To prove it, it has been checked for typographical errors.
See the authors' detailed response to the review by Muhammad Kamran Siddique
See the authors' detailed response to the review by Ismail Naci Cangul
In this paper, we study the local multiset dimension of the amalgamation of graphs. One of the topics of distance in graphs is resolving set problems. This topic has many application in science and technology namely in the navigation of robots, chemistry structure, and computer sciences. The application of metric dimension in networks is the navigation of robots. Suppose, we represent a place as a vertex and a connection between place is represented by an edge. The minimum numbers of robots required to locate each vertex in the networks is part of the resolving set problems. More details of this application can be seen.1
Several applications of resolving sets in chemistry are the substructures of a chemical compound which can be denoted by a set of functional groups. Moreover, in a chemical structure or molecular graph edges and vertices are known as bonds and atoms, respectively. Furthermore, the sub graphs are simply deliberated as substructures and functional groups. Now after altering the position of functional groups, the formed collections of compounds are distinguished as substructures being similar to each other. Later on using the method of traditional view, we can investigate if any two compounds hold the same functional group at the same point, while in drugs discovery comparative statements contributes a critical part to determine pharmacological activities related to the feature of compounds.2
All graphs G are simple, finite, and connected. Given that the vertex set V (G) and the edge set E(G), we write G = (V, E). The distance of u and v, denoted by d(u, v) is the length of the shortest path of the vertices u to v. For the set W = {s1, s2, …, sk} ⊂ V (G), the vertex representations of the vertex x to the set W is an ordered k-tuple, r(x|W) = (d(x, s1), d(x, s2), …, d(x, sk)). The set W is called the resolving set of G if all vertices of G have different vertex representations. The resolving set having minimum cardinality is called basis and its cardinality is called metric dimension of G, denoted by dim(G).3 Okamoto et al.4 introduced the new variant of resolving set problems which is called local resolving set problems. In his paper, this notion is called a local multiset dimension of graphs G. The set W is called a local resolving set if for every xy ∈ E(G), r(x|W)≠r(y|W). The local resolving set having minimum cardinality is called local basis and it’s cardinality is called local metric dimension of G and denoted by ldim(G).
Simanjuntak et al.5 defined multiset dimension of graphs G. Suppose the set , the vertex representations of a vertex x ∈ V (G) to the set W is the multiset where d(x, si) is the length of the shortest path of the vertex x and the vertex in W together with their multiplicities. The set W is called a m-resolving set if for every xy ∈ E(G), rm(x|W)≠rm(y|W). If G has a m-resolving set then an m-resolving set having minimum cardinality is called a multiset basis and it’s cardinality is called the multiset dimension of graphs G and denoted by md(G); otherwise we say that G has an infinite multiset dimension and we write . Alfarisi et al.6 studied the multiset dimension of almost hypercube graphs. Later, Alfarisi et al.7 extended a new notion based on the multiset dimension of G, namely a local multiset dimension. Suppose the set , the vertex representations of a vertex x ∈ V (G) to the set W is rm(x|W) = {d(x, s1), d(x, s2), …, d(x, sk)}. The set W is called a local m-resolving set of G if rm(v|W)≠rm(u|W) for uv ∈ E(G). The local m-resolving set having minimum cardinality is called the local multiset basis and it’s cardinality is called the local multiset dimension, denoted by mdl(G): otherwise we say that G has an infinite local multiset dimension and we write .
We illustrate this concept in Figure 1. In this case, the m-resolving set is W = {v2, v3, v6}, shown in Figure 1(a). The multiset dimension is md(G) = 3. The representations of v ∈ V (G) with respect to W are all distinct. For the local multiset dimension, we only need to make sure the adjacent vertices have distinct representations. Thus, we could have the local m-resolving set W = {v1}, shown in Figure 1(b). Thus, the local multiset dimension is mdl(G) = 1.
We have some results on the local multiset dimension of some known graphs namely path, star, tree, and cycle and also the local multiset dimension of graph operations namely, cartesian product,7 m-shadow graph.8 Adawiyah et al.9 also studied local multiset dimension of unicyclic graphs. The followings are some results which is used for proving the new results in this study.
Let G be a connected graphs and W ⊂ V (G). If W contains a resolving set of G, then W is a resolving set of G.10
A graph is bipartite if and only if it contains no odd cycle.11
The local multiset dimension of G is one if and only if G is a bipartite graph.12
If T is tree graph with order n, then mdl(T) = 1.12
Let Kn be a complete graph with n ≥ 3, we have .6
Let (Gi) be a finite collection of graphs and each Gi has a fixed vertex v called a terminal. The amalgamation Amal(Gi, v, m) is formed by taking of all the Gi and identifying their terminal.
Figure 2 is an example of an amalgamation graph with isomorphic and non-isomorphic graph.
The nature of the methods follows an extrapolative design. There are several stages in this research as follows:
1. Choose the special graph which is operated by amalgamation;
2. Determining the set of vertices and edges of amalgamation of graphs;
3. Determining the set W ⊂ V (G);
4. Determining the vertex representation of two adjacent vertices in G;
5. Proving the theorem.
The flowchart of this method can be seen in Figure 3.
In this section, we investigated the local multiset dimension of graph amalgamation. We provide an upper bound of local multiset dimension of Amal(G, v, m) and we show that the upper bound is sharp. We also determined the exact value of the local multiset dimension of Amal(G, v, m) for some certain graphs namely path, complete graph, fan graph, and wheel graph. The following theorem provides a sharp upper bound of Amal(G, v, m).
Let m and n be two integers with m ≥ 2 and n ≥ 3. Let G be a connected graph of order n and v be a terminal vertex of G, then mdl (Amal(G, v, m)) ≤ m.mdl(G)
We show that mdl (Amal(G, v, m)) ≤ m.mdl(G). Let W be the local m-resolving set of G. Amal(G, v, m) has m copies of G, such that . We take identified vertex v ∉ W, thus two adjacent vertices uk,r, uk,s ∈ V (G) have different representation. There are two conditions for uk,r, uk,s ∈ V (G) to terminal vertex.
1. For uk,r, uk,s ∈ V (G) and d (uk,r, v) = d (uk,s, v), then d (uk,r, w) = d (uk,s, w) for w ∈ S − Wk. Thus, rm (uk,r|S)≠rm (uk,s|S).
2. For uk,r, uk,s ∈ V (G) and d (uk,r, v)≠d (uk,s, v), then d (uk,r, w)≠d (uk,s, w) for w ∈ S − Wk. Thus, rm (uk,r|S)≠rm (uk,s|S).
Based on 1 and 2 that is the local m-resolving set of Amal(G, v, m). Thus, mdl (Amal(G, v, m)) ≤ m.mdl(G). □
If Amal (Pn, v, m) is an amalgamation of m paths, then mdl (Amal(Pn, v, m)) = 1
Since Pn is bipartite graph, then Amal (Pn, v, m) is bipartite graph. Based on Theorem 0.1 that mdl (Amal(Pn, v, m)) = 1. □
If Amal (Kn, v, m) is an amalgamation of m complete graphs, then
For two adjacent vertices x, y ∈ V ((Kn)k) with k ∈ [1, m] such that we have d(x, u) = d(y, u). Since d(x, u) = d(y, u), then d(x, w) = d(y, w) with w ∈ V (Amal (Kn, v, m)). Thus, rm(x|W)≠rm(y|W). □
Consider graph Amal (Wn, v, m) where v is a center vertex of Wn. Let V (Amal (Wn, v, m)) = {v} ∪ {uj, i;1 ≤ j ≤ m and 1 ≤ i ≤ n} such that .
Let m and n be two integers with m ≥ 2 and n ≥ 3. Let Wn be a wheel graph of order n + 1 and v ∈ V (Wn) where v is a center vertex of Wn, then mdl (Amal (Wn, v, m)) = m.mdl (Wn).
Let W be a local m-resolvings of Wn and S be a local m-resolving set of Amal (Wn, v, m) Based on Lemma 0.2 that mdl (Amal(Wn, v, m)) ≤ m.mdl (Wn). Furthermore, we will show that mdl (Amal(Wn, v, m)) ≥ m.mdl (Wn). Take any S ⊂ V (Amal (Wn, v, m)) with |P|<|S|. Suppose |P|=|S| − 1 = m.|W| − 1. There is one copy of Wn, (Wn)k have |Wk|− 1, such that we have three condition as follows
i For n ≡ 0(mod4)
Let u(k, l) ∉ P for 1 ≤ l ≤ n or i ≡ 4s − 3 with and d (uk, 4(s−1)−3, u4(s+1)−3) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal(Wn, v, m).
ii For n ≡ 2(mod4)
There are three possibilities namely 1) uk,1 ∉ P; 2) uk,l ∉ P for 1 < l < n − 1 and 3) uk,n−1 ∈ P.
(a) Let uk,1 ∉ P, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Wn, v, m).
(b) Let uk,l ∉ P for 1 < l < n − 1 or i ≡ 4s − 3 with and d (uk, 4(s−1)−3, uk, 4(s+1)−3) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Wn, v, m).
(c) Let uk,n−1 ∉ P. Since . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Wn, v, m).
iii For n ≡ 1, 3(mod4)
We know that , so there are two adjacent vertices x, y ∈ V (Wn), rm(x|Wk) = rm(y|Wk). Since d(x, v) = d(y, v) and d(x, w) = d(x, w) where w ∈ P − Wk, then rm(x|P) = rm(y|P). Thus, .
Based on i), ii), and iii) that mdl (Amal (Wn, v, m)) = m.mdl (Wn). □
For further discussion, consider graph Amal (Wn, v, m) where v is not a center vertex of Wn. Let V (Amal (Wn, v, m)) = {v} ∪ {uj;1 ≤ j ≤ m} ∪ {uj, i;1 ≤ j ≤ m and 1 ≤ i ≤ n − 1} such that E (Amal(Wn, v, m)) = {vuj, vuj,1, vuj,n−1}∪{uj, iuj, i+1;1 ≤ i ≤ n−2}∪{ujuj, i;1 ≤ j ≤ m, 1 ≤ i ≤ n−1}.
Let m and n be two integers with m ≥ 2 and n ≥ 3. Let Wn be a wheel graph of order n + 1 and v ∈ V (Wn) where v is not center vertex of Wn, then
We consider four cases.
For n ≡ 0(mod 4)
Choose S = {uj,i;1 ≤ j ≤ m, 1 ≤ i ≤ n − 1, i ≡ 0(mod4)} obtained the vertex representation as follows
1. For uk, v ∈ V (Amal (Wn, v, m)), d(v, w)≠d (uk, w) where w ∈ S − Wk such that rm(v|S − Wk)≠rm (uk|S − Wk). Since d(v, w)≠d (uk, w) where w ∈ Wk such that rm(v|Wk)≠rm (uk|Wk). Thus, rm(v|S)≠rm (uk|S).
2. For uk, uk,l ∈ V ((Wn)k) and l≠0(mod4). Since uk adjacent to w where w ∈ Wk, such that rm (uk|Wk)≠rm (uk,l|Wk). Since d (uk, w)≠d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk)≠rm (uk,l|S − Wk) with l≠1, n − 1. Since d (uk, w) = d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk) = rm (uk,l|S − Wk) with l = 1, n − 1. Thus, rm(v|S)≠rm (uk|S).
3. For uk, i ∈ V ((Wn)k) and 1 ≤ i ≤ 3. Since d (uk,1, w)≠d (uk,2, w) where w ∈ S − Wk and d (uk,1, w)≠d (uk,2, w) where w ∈ Wk such that rm (uk,1|S)≠rm (uk,2|S). Since d (uk,2, w) = d (uk,3, w) where w ∈ S − Wk and d (uk,2, w)≠d (uk,3, w) where w ∈ Wk such that rm (uk,2|S)≠rm (uk,3|S).
4. For uk, i ∈ V ((Wn)k) and n − 3 ≤ i ≤ n − 1. Since d (uk,n−1, w)≠d (uk,n−2, w) where w ∈ S − Wk and d (uk,n−1, w)≠d (uk,n−2, w) where w ∈ Wk such that rm (uk,n−1|S)≠rm (uk,n−2|S). Since d (uk,n−2, w) = d (uk,n−3, w) where w ∈ S − Wk and d (uk,n−2, w)≠d (uk,n−3, w) where w ∈ Wk such that rm (uk,n−2|S)≠rm (uk,n−3|S).
5. For uk, i ∈ V ((Wn)k) where 4l + 1 ≤ i ≤ 4l + 3 and . Since d (uk,4l+1, w)≠d (uk,4l+2, w) where w ∈ S − Wk and d (uk,4l+1, w)≠d (uk,4l+2, w) where w ∈ Wk such that rm (uk,4l+1|S)≠rm (uk,4l+2|S). Since d (uk,4l+2, w) = d (uk,4l+3, w) where w ∈ S − Wk and d (uk,4l+2, w)≠d (uk,4l+3, w) where w ∈ Wk such that rm (uk,4l+2|S)≠rm (uk, 4l+3|S).
Based on the representation above that every two adjacent vertices has distinct representations such that S is local m-resolving set and . Furthermore, proving that m. Taking any set P ⊂ V (Amal (Wn, v, m)) with . Let u(k, l) ∉ P for l ≡ 4s with and d (uk, 4(s−1), uk,4(s+1)) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Wn, v, m). Thus, .
For n ≡ 1(mod 4)
Choose S = {uj, i;1 ≤ j ≤ m, 1 ≤ i ≤ n − 1, i ≡ 0(mod4)} obtained the vertex representation as follows
1. For uk, v ∈ V (Amal (Wn, v, m)), d(v, w)≠d (uk, w) where w ∈ S − Wk such that rm(v|S − Wk)≠rm (uk|S − Wk). Since d(v, w)≠d (uk, w) where w ∈ Wk such that rm(v|Wk)≠rm (uk|Wk). Thus, rm(v|S)≠rm (uk|S).
2. For uk, uk,l ∈ V ((Wn)k) and l≠0(mod4). Since uk adjacent to w where w ∈ Wk, such that rm (uk|Wk)≠rm (uk,l|Wk). Since d (uk, w)≠d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk)≠rm (uk,l|S − Wk) with l≠1, n − 1. Since d (uk, w) = d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk) = rm (uk,l|S − Wk) with l = 1, n − 1. Thus, rm(v|S)≠rm (uk|S).
3. For uk, i ∈ V ((Wn)k) and 1 ≤ i ≤ 3. Since d (uk,1, w)≠d (uk,2, w) where w ∈ S − Wk and d (uk,1, w)≠d (uk,2, w) where w ∈ Wk such that rm (uk,1|S)≠rm (uk,2|S). Since d (uk,2, w) = d (uk,3, w) where w ∈ S − Wk and d (uk,2, w)≠d (uk,3, w) where w ∈ Wk such that rm (uk,2|S)≠rm (uk,3|S).
4. For uk, i ∈ V ((Wn)k) where 4l + 1 ≤ i ≤ 4l + 3 and . Since d (uk,4l+1, w)≠d (uk,4l+2, w) where w ∈ S − Wk and d (uk,4l+1, w)≠d (uk,4l+2, w) where w ∈ Wk such that rm (uk,4l+1|S)≠rm (uk,4l+2|S). Since d (uk,4l+2, w) = d (uk,4l+3, w) where w ∈ S − Wk and d (uk,4l+2, w)≠d (uk,4l+3, w) where w ∈ Wk such that rm (uk,4l+2|S)≠rm (uk,4l+3|S).
Based on the representation above that every two adjacent vertices has distinct representation such that S is local m-resolving set and . Furthermore, proving that m. Taking any set P ⊂ V (Amal (Wn, v, m)) with . Let u(k, l) ∉ P for l ≡ 4s with and d (uk,4(s−1), uk,4(s+1)) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Wn, v, m). Thus,
For n ≡ 2(mod 4)
Choose S = {uj, i;1 ≤ j ≤ m, 1 ≤ i ≤ n − 1, i ≡ 0(mod4)} obtained the vertex representation as follows
1. For uk, v ∈ V (Amal (Wn, v, m)), d(v, w)≠d (uk, w) where w ∈ S − Wk such that rm(v|S − Wk)≠rm (uk|S − Wk). Since d(v, w)≠d (uk, w) where w ∈ Wk such that rm(v|Wk)≠rm (uk|Wk). Thus, rm(v|S)≠rm (uk|S).
2. For uk, uk,l ∈ V ((Wn)k) and l≠0(mod4). Since uk adjacent to w where w ∈ Wk, such that rm (uk|Wk)≠rm (uk,l|Wk). Since d (uk, w)≠d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk)≠rm (uk,l|S − Wk) with l≠1, n − 1. Since d (uk, w) = d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk) = rm (uk,l|S − Wk) with l = 1, n − 1. Thus, rm(v|S)≠rm (uk|S).
3. For uk,i ∈ V ((Wn)k) and 1 ≤ i ≤ 3. Since d (uk,1, w)≠d (uk,2, w) where w ∈ S − Wk and d (uk,1, w)≠d (uk,2, w) where w ∈ Wk such that rm (uk,1|S)≠rm (uk,2|S). Since d (uk,2, w) = d (uk,3, w) where w ∈ S − Wk and d (uk,2, w)≠d (uk,3, w) where w ∈ Wk such that rm (uk,2|S)≠rm (uk,3|S).
4. For uk, i ∈ V ((Wn)k) where 4l + 1 ≤ i ≤ 4l + 3 and . Since d (uk,4l+1, w)≠d (uk,4l+2, w) where w ∈ S − Wk and d (uk,4l+1, w)≠d (uk,4l+2, w) where w ∈ Wk such that rm (uk,4l+1|S)≠rm (uk,4l+2|S). Since d (uk,4l+2, w) = d (uk,4l+3, w) where w ∈ S − Wk and d (uk,4l+2, w)≠d (uk,4l+3, w) where w ∈ Wk such that rm (uk,4l+2|S)≠rm (uk,4l+3|S).
Based on the representation above that every two adjacent vertices has distinct representation such that S is local m-resolving set and . Furthermore, proving that m. Taking any set P ⊂ V (Amal (Wn, v, m)) with . Let u(k, l) ∉ P for l ≡ 4s with and d (uk,4(s−1), uk,4(s+1)) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Wn, v, m). Thus,
For n ≡ 3(mod 4)
Choose S = {uj, i;1 ≤ j ≤ m, 1 ≤ i ≤ n − 1, i ≡ 0(mod4)} obtained the vertex representation as follows
1. For uk, v ∈ V (Amal (Wn, v, m)), d(v, w)≠d (uk, w) where w ∈ S − Wk such that rm(v|S − Wk)≠rm (uk|S − Wk). Since d(v, w)≠d (uk, w) where w ∈ Wk such that rm(v|Wk)≠rm (uk|Wk). Thus, rm(v|S)≠rm (uk|S).
2. For uk, uk,l ∈ V ((Wn)k) and l≠0(mod4). Since uk adjacent to w where w ∈ Wk, such that rm (uk|Wk)≠rm (uk,l|Wk). Since d (uk, w)≠d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk)≠rm (uk,l|S − Wk) with l≠1, n − 1. Since d (uk, w) = d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk) = rm (uk,l|S − Wk) with l = 1, n − 1. Thus, rm(v|S)≠rm (uk|S).
3. For uk, i ∈ V ((Wn)k) and 1 ≤ i ≤ 3. Since d (uk,1, w)≠d (uk,2, w) where w ∈ S − Wk and d (uk,1, w)≠d (uk,2, w) where w ∈ Wk such that rm (uk,1|S)≠rm (uk,2|S). Since d (uk,2, w) = d (uk,3, w) where w ∈ S − Wk and d (uk,2, w)≠d (uk,3, w) where w ∈ Wk such that rm (uk,2|S)≠rm (uk,3|S).
4. For uk, i ∈ V ((Wn)k) and n − 2 ≤ i ≤ n − 1. Since d (uk,n−1, w)≠d (uk,n−2, w) where w ∈ S − Wk and d (uk,n−1, w)≠d (uk,n−2, w) where w ∈ Wk such that rm (uk,n−1|S)≠rm (uk,n−2|S).
5. For uk, i ∈ V ((Wn)k) where 4l + 1 ≤ i ≤ 4l + 3 and . Since d (uk,4l+1, w)≠d (uk,4l+2, w) where w ∈ S − Wk and d (uk,4l+1, w)≠d (uk,4l+2, w) where w ∈ Wk such that rm (uk,4l+1|S)≠rm (uk,4l+2|S). Since d (uk,4l+2, w) = d (uk,4l+3, w) where w ∈ S − Wk and d (uk,4l+2, w)≠d (uk,4l+3, w) where w ∈ Wk such that rm (uk,4l+2|S)≠rm (uk,4l+3|S).
Based on the representation above that every two adjacent vertices has distinct representations such that S is local m-resolving set and . Furthermore, proving that m. Taking any set P ⊂ V (Amal (Wn, v, m)) with . Let u(k, l) ∉ P for l ≡ 4s with and d (uk,4(s−1), uk, 4(s+1)) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Wn, v, m). Thus, . □
Consider graph Amal (Fn, v, m) where v is a center vertex of Fn. Let V (Amal (Fn, v, m)) = {v} ∪ {uj, i;1 ≤ j ≤ mand1 ≤ i ≤ n} such that .
Let m and n be two integers with m ≥ 2 and n ≥ 6. Let Fn be a fan graph of order n + 1 and v ∈ V (Fn) where v is a center vertex of Fn, then mdl (Amal (Fn, v, m)) = m.mdl (Fn)
Let W be a local m-resolving set of Fn and S be a local m-resolving set of Amal (Fn, v, m) Based on Lemma 0.2 that mdl (Amal(Fn, v, m)) ≤ m.mdl (Fn). Furthermore, we will show that mdl (Amal(Fn, v, m)) ≥ m.mdl (Fn). Take any S ⊂ V (Amal (Fn, v, m)) with |P|<|S|. Suppose |P|=|S| − 1 = m.|W| − 1. There are one copies of Fn, (Fn)k have |Wk|− 1, such that we have two condition as follows
i For n ≡ 1(mod4)
There are three possibilities namely 1) uk,3 ∉ P; 2) uk,l ∉ P for 3 < l < n − 2 and 3) uk,n−2 ∈ P.
(a) Let uk,3 ∉ P. Since uk,1uk,2 ∈ E((Fn)k), then . Since d (uk,1, w) = d (uk,2, w) for w ∈ P − Wk and rm (uk,1|P) = rm (uk,2|P), then P is not local m-resolving set of Amal (Fn, v, m).
(b) Let uk,l ∉ P for 3 < l < n − 2 or i ≡ 4s − 1 with and d (uk, 4(s−1)−1, uk, 4(s+1)−1) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
(c) Let uk,n−2 ∉ P. Since uk,n−1uk, n ∈ E((Fn)k), then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
ii For n ≡ 0, 2, 3(mod4)
There are three possibilities namely 1) uk,1 ∉ P; 2) uk,l ∉ P for 1 < l < n − 1 and 3) uk,n−1 ∈ P for n ≡ 0(mod4), uk,n−1 ∈ P for n ≡ 2(mod4), and uk,n ∈ P for n ≡ 3(mod4).
(a) Let uk,3 ∉ P. Since . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
(b) Let uk,l ∉ P for 3 < l < n − 2 or i ≡ 4s − 1 with and d (uk,4(s−1)−1, uk, 4(s+1)−1) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
(c) Let uk,n−1 ∉ P for n ≡ 0(mod4). Since . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
(d) Let uk,n−1 ∉ P for n ≡ 2(mod4). Since . Since d (uk,n−1, w) = d (uk,n, w) for w ∈ P − Wk and rm (uk,n−1|P) = rm (uk,n|P), then P is not local m-resolving set of Amal (Fn, v, m).
(e) Let uk,n ∉ P for n ≡ 3(mod4). Since . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
Based on i) and ii) that mdl (Amal (Fn, v, m)) = m.mdl (Fn). □
For further discussion, consider graph Amal (Fn, v, m) where v ∈ V (Fn) with d(v) = 2. Let V (Amal (Fn, v, m)) = {v} ∪ {uj;1 ≤ j ≤ m} ∪ {uj, i;1 ≤ j ≤ mand1 ≤ i ≤ n − 1} such that E (Amal(Fn, v, m)) = {vuj, vuj,1}∪{uj, iuj, i+1;1 ≤ i ≤ n−2}∪{ujuj, i;1 ≤ j ≤ m, 1 ≤ i ≤ n−1}.
Let m and n be two integers with m ≥ 2 and n ≥ 3. Let Fn be a fan graph of order n + 1 and v ∈ V (Fn) where d(v) = 2, then
We have some condition for the set S as follows
a for n ≡ 1, 2, 3(mod4), S = {uj, i;1 ≤ j ≤ m, 1 ≤ i ≤ n − 1, i ≡ 0(mod4)}.
b for n ≡ 0(mod4), S = {uj, i;1 ≤ j ≤ m, 1 ≤ i ≤ n − 1, i ≡ 0(mod4)} ∪ {uj,n−2}.
We obtained the vertex representation as follows
1. For uk, v ∈ V (Amal (Fn, v, m)), d(v, w)≠d (uk, w) where w ∈ S − Wk such that rm(v|S − Wk)≠rm (uk|S − Wk). Since d(v, w)≠d (uk, w) where w ∈ Wk such that rm(v|Wk)≠rm (uk|Wk). Thus, rm(v|S)≠rm (uk|S).
2. For uk, uk,l ∈ V ((Fn)k) where l≠0(mod4) and uk,l where l≠n − 2 for n ≡ 0(mod4). Since uk is adjacent to w where w ∈ Wk, such that rm (uk|Wk)≠rm (uk,l|Wk). Since d (uk, w)≠d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk)≠rm (uk,l|S − Wk) with l≠1. Since d (uk, w) = d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk) = rm (uk,l|S − Wk) with l = 1. Thus, rm(v|S)≠rm (uk|S).
3. For uk, i ∈ V ((Fn)k) and 1 ≤ i ≤ 3. Since d (uk,1, w)≠d (uk,2, w) where w ∈ S − Wk and d (uk,1, w)≠d (uk,2, w) where w ∈ Wk such that rm (uk,1|S)≠rm (uk,2|S). Since d (uk,2, w) = d (uk,3, w) where w ∈ S − Wk and d (uk,2, w)≠d (uk,3, w) where w ∈ Wk such that rm (uk,2|S)≠rm (uk,3|S).
4. For uk, i ∈ V ((Fn)k) where 4l + 1 ≤ i ≤ 4l + 3 and . Since d (uk,4l+1, w)≠d (uk,4l+2, w) where w ∈ S − Wk and d (uk,4l+1, w)≠d (uk,4l+2, w) where w ∈ Wk such that rm (uk,4l+1|S)≠rm (uk,4l+2|S). Since d (uk,4l+2, w) = d (uk,4l+3, w) where w ∈ S − Wk and d (uk,4l+2, w)≠d (uk,4l+3, w) where w ∈ Wk such that rm (uk,4l+2|S)≠rm (uk,4l+3|S).
5. For uk, i ∈ V ((Fn)k) where n − 2 ≤ i ≤ n − 1 and n ≡ 3(mod4). Since d (uk,n−1, w) = d (uk,n−2, w) where w ∈ S − Wk and d (uk,n−1, w)≠d (uk,n−2, w) where w ∈ Wk such that rm (uk,n−1|S)≠rm (uk,n−2|S).
Based on the representation above that every two adjacent vertices has distinct representations such that S is local m-resolving set and .
Furthermore, we will show that . Take any S ⊂ V (Amal (Fn, v, m)) with|P|<|S|. Suppose . There are one copies of Fn, (Fn)k have , such that we have two condition as follows
i For n ≡ 1(mod4)
There are two possibilities namely 1) uk,l ∉ P for 1 < l < n − 1 and 2) uk,n−1 ∉ P.
ii For n ≡ 0, 2, 3(mod4)
There are three possibilities namely 1) uk,l ∉ P for 1 < l < n − 1 and 2) uk,n−1 ∈ P for n ≡ 0(mod4), uk,n−2 ∈ P for n ≡ 2(mod4), and uk,n−3 ∈ P for n ≡ 3(mod4).
(a) Let uk,l ∉ P for 1 < l < n − 1 or l ≡ 4s with and d (uk, 4(s−1)+1, uk, 4(s+1)−1) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
(b) Let uk,n−1 ∉ P for n ≡ 0(mod4). Since . Since d (uk,n−2, w) = d (uk,n−1, w) for w ∈ P − Wk and rm (uk,n−2|P) = rm (uk,n−1|P), then P is not local m-resolving set of Amal (Fn, v, m).
(c) Let uk,n−2 ∉ P for n ≡ 2(mod4). Since . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
(d) Let uk,n−3 ∉ P for n ≡ 3(mod4). Since . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
Based on i) and ii) that . □
Let m and n be two integers with m ≥ 2 and n ≥ 3. Let Fn be a fan graph of order n + 1 and v ∈ V (Fn) where d(v) = 3, then
Since Identified vertex v = uj, p, then we have two part namely uj,1 − uj, p−1 and uj, p+1 − uj, n. We consider two cases as follows
For 2 ≤ p ≤ 3
For d (uj,1, uj, p−1) ≤ 2, then the vertices don’t need to be resolver. Thus, we focus for d (uj, p+1, uj, n) ≥ 3
For n − p ≡ 0, 1, 2(mod4)
Choose S = {uj,r;1 ≤ j ≤ m, r ≡ p (mod4), r > p} obtained the vertex representation as follows
1. For uk,l ∈ V (Amal (Fn, v, m)) and 1 ≤ l ≤ p − 1, d (uk,1, w)≠d (uk,2, w) where w ∈ S − Wk such that rm (uk,1|S − Wk)≠rm (uk,2|S − Wk). Since d (uk,1, w) = d (uk,2, w) where w ∈ Wk such that rm (uk,1|Wk)≠rm (uk,2|Wk). Thus, rm (uk,1|S)≠rm (uk,2|S).
2. For uk, v ∈ V (Amal (Fn, v, m)), d(v, w)≠d (uk, w) where w ∈ S − Wk such that rm(v|S − Wk)≠rm (uk|S − Wk). Since d(v, w)≠d (uk, w) where w ∈ Wk such that rm(v|Wk)≠rm (uk|Wk). Thus, rm(v|S)≠rm (uk|S).
3. For uk, uk,l ∈ V ((Fn)k) where l≠p (mod4) and uk,l where l≠n − 2 for n − p ≡ 2(mod4). Since uk adjacent to w where w ∈ Wk, such that rm (uk|Wk)≠rm (uk,l|Wk). Since d (uk, w)≠d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk)≠rm (uk,l|S − Wk) with l≠1. Since d (uk, w) = d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk) = rm (uk,l|S − Wk) with l = 1. Thus, rm(v|S)≠rm (uk|S).
4. For uk, i ∈ V ((Fn)k) and p + 1 ≤ i ≤ p + 3. Since d (uk, p+1, w)≠d (uk, p+2, w) where w ∈ S − Wk and d (uk, p+1, w)≠d (uk, p+2, w) where w ∈ Wk such that rm (uk, p+1|S)≠rm (uk, p+2|S). Since d (uk, p+2, w) = d (uk, p+3, w) where w ∈ S − Wk and d (uk, p+2, w)≠d (uk, p+3, w) where w ∈ Wk such that rm (uk, p+2|S)≠rm (uk, p+3|S).
5. For uk, i ∈ V ((Fn)k) where p + 4l + 1 ≤ i ≤ p + 4l + 3 and . Since d (uk, p+4l+1, w)≠d (uk, p+4l+2, w) where w ∈ S − Wk and d (uk, p+4l+1, w)≠d (uk, p+4l+2, w) where w ∈ Wk such that rm (uk, p+4l+1|S)≠rm (uk, p+4l+2|S). Since d (uk, p+4l+2, w) = d (uk, p+4l+3, w) where w ∈ S − Wk and d (uk, p+4l+2, w)≠d (uk, p+4l+3, w) where w ∈ Wk such that rm (uk, p+4l+2|S)≠rm (uk, p+4l+3|S).
Based on the representation above that every two adjacent vertices have distinct representations such that S is local m-resolving set and .
Furthermore, we will show that . Take any S ⊂ V (Amal (Fn, v, m)) with |P|<|S|. Suppose . There is one copy of Fn, (Fn)k have . Let uk,l ∉ P for p + 1 < l ≤ n − 1 or l ≡ p + 4s with and d (uk, p+4(s−1)+1, uk, p+4(s+1)−1) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m). Thus, .
For n − p ≡ 3(mod4)
Choose S = {uj,r;1 ≤ j ≤ m, r ≡ p (mod4), r > p} ∪ {uj,n−1} obtained the vertex representation as follows
1. For uk,l ∈ V (Amal (Fn, v, m)) and 1 ≤ l ≤ p − 1, d (uk,1, w)≠d (uk,2, w) where w ∈ S − Wk such that rm (uk,1|S − Wk)≠rm (uk,2|S − Wk). Since d (uk,1, w) = d (uk,2, w) where w ∈ Wk such that rm (uk,1|Wk)≠rm (uk,2|Wk). Thus, rm (uk,1|S)≠rm (uk,2|S).
2. For uk, v ∈ V (Amal (Fn, v, m)), d(v, w)≠d (uk, w) where w ∈ S − Wk such that rm(v|S − Wk)≠rm (uk|S − Wk). Since d(v, w)≠d (uk, w) where w ∈ Wk such that rm(v|Wk)≠rm (uk|Wk). Thus, rm(v|S)≠rm (uk|S).
3. For uk, uk,l ∈ V ((Fn)k) where l≠p (mod4) and uk,l where l≠n − 2 for n − p ≡ 3(mod4). Since uk adjacent to w where w ∈ Wk, such that rm (uk|Wk)≠rm (uk,l|Wk). Since d (uk, w)≠d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk)≠rm (uk,l|S − Wk) with l≠1. Since d (uk, w) = d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk) = rm (uk,l|S − Wk) with l = 1. Thus, rm(v|S)≠rm (uk|S).
4. For uk, i ∈ V ((Fn)k) and p + 1 ≤ i ≤ p + 3. Since d (uk, p+1, w)≠d (uk, p+2, w) where w ∈ S − Wk and d (uk, p+1, w)≠d (uk, p+2, w) where w ∈ Wk such that rm (uk, p+1|S)≠rm (uk, p+2|S). Since d (uk, p+2, w) = d (uk, p+3, w) where w ∈ S − Wk and d (uk, p+2, w)≠d (uk, p+3, w) where w ∈ Wk such that rm (uk, p+2|S)≠rm (uk, p+3|S).
5. For uk, i ∈ V ((Fn)k) where p + 4l + 1 ≤ i ≤ p + 4l + 3 and . Since d (uk, p+4l+1, w)≠d (uk, p+4l+2, w) where w ∈ S − Wk and d (uk, p+4l+1, w)≠d (uk, p+4l+2, w) where w ∈ Wk such that rm (uk, p+4l+1|S)≠rm (uk, p+4l+2|S). Since d (uk, p+4l+2, w) = d (uk, p+4l+3, w) where w ∈ S − Wk and d (uk, p+4l+2, w)≠d (uk, p+4l+3, w) where w ∈ Wk such that rm (uk, p+4l+2|S)≠rm (uk, p+4l+3|S).
6. For uk, i ∈ V ((Fn)k) where i = n − 2, n. Since uk,n−2 is not adjacent to uk, n. It is clear.
Based on the representation above that every two adjacent vertices has distinct representations such that S is local m-resolving set and .
Furthermore, we will show that . Take any S ⊂ V (Amal (Fn, v, m)) with|P|<|S|. Suppose . There are one copies of Fn, (Fn)k have . There are two possibilities namely 1) uk,l ∉ P for 1 < l < n − 1 and 2) uk,n−1 ∉ P.
1. Let uk,l ∉ P for 1 < l ≤ n − 1 or l ≡ p + 4s with and d (uk, p+4(s−1)+1, uk, p+4(s+1)−1) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
2. Let uk,n−1 ∉ P. Since . Since d (uk,n−1, w) = d (uk, n, w) for w ∈ P − Wk and rm (uk,n−1|P) = rm (uk, n|P), then P is not local m-resolving set of Amal (Fn, v, m).
Based on 1) and 2) that . Thus, .
For
For n − p ≡ 0, 1, 2(mod4)
We have some conditions for the set S as follows:
a for p ≡ 1(mod4), S = {uj, t;1 ≤ j ≤ m, t ≡ 1(mod4)} ∪ {uj,r;1 ≤ j ≤ m, r ≡ p (mod4), r > p}.
b for p ≡ 2(mod4), S = {uj, t;1 ≤ j ≤ m, t ≡ 2(mod4)} ∪ {uj,r;1 ≤ j ≤ m, r ≡ p (mod4), r > p}.
c for p ≡ 3(mod4), S = {uj, t;1 ≤ j ≤ m, t ≡ 3(mod4)} ∪ {uj,r;1 ≤ j ≤ m, r ≡ p (mod4), r > p}.
d for p ≡ 0(mod4), S = {uj, t;1 ≤ j ≤ m, t ≡ 0(mod4)} ∪ {uj,r;1 ≤ j ≤ m, r ≡ p (mod4), r > p}.
We obtained the vertex representation as follows:
1. For uk, i ∈ V ((Fn)k) where p − 3 ≤ i ≤ p − 1 and p ≡ 0, 1, 2, 3(mod4). Since d (uk, p−1, w)≠d (uk, p−2, w) where w ∈ S − Wk and d (uk, p−1, w)≠d (uk, p−2, w) where w ∈ Wk such that rm (uk, p−1|S)≠rm (uk, p−2|S). Since d (uk, p−2, w) = d (uk, p−3, w) where w ∈ S − Wk and d (uk, p−2, w)≠d (uk, p−3, w) where w ∈ Wk such that rm (uk, p−2|S)≠rm (uk, p−3|S).
2. For uk, i ∈ V ((Fn)k) where p − 4l + 1 ≤ i ≤ p − 4l + 3, , and ap ≡ 0, 1, 2, 3(mod4). Since d (uk, p−4l+1, w)≠d (uk, p−4l+2, w) where w ∈ S − Wk and d (uk, p−4l+1, w)≠d (uk, p−4l+2, w) where w ∈ Wk such that rm (uk, p−4l+1|S)≠rm (uk, p−4l+2|S). Since d (uk, p−4l+2, w) = d (uk, p−4l+3, w) where w ∈ S − Wk and d (uk, p−4l+2, w)≠d (uk, p−4l+3, w) where w ∈ Wk such that rm (uk, p−4l+2|S)≠rm (uk, p−4l+3|S).
3. For uk,l ∈ V (Amal (Fn, v, m)) and 1 ≤ l ≤ p − 1, d (uk,1, w)≠d (uk,2, w) where w ∈ S − Wk such that rm (uk,1|S − Wk)≠rm (uk,2|S − Wk). Since d (uk,1, w) = d (uk,2, w) where w ∈ Wk such that rm (uk,1|Wk)≠rm (uk,2|Wk). Thus, rm (uk,1|S)≠rm (uk,2|S).
4. For uk, v ∈ V (Amal (Fn, v, m)), d(v, w)≠d (uk, w) where w ∈ S − Wk such that rm(v|S − Wk)≠rm (uk|S − Wk). Since d(v, w)≠d (uk, w) where w ∈ Wk such that rm(v|Wk)≠rm (uk|Wk). Thus, rm(v|S)≠rm (uk|S).
5. For uk, uk,l ∈ V ((Fn)k) where l≠p (mod4) and uk,l where l≠n − 2 for n − p ≡ 2(mod4). Since uk adjacent to w where w ∈ Wk, such that rm (uk|Wk)≠rm (uk,l|Wk). Since d (uk, w)≠d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk)≠rm (uk,l|S − Wk) with l≠1. Since d (uk, w) = d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk) = rm (uk,l|S − Wk) with l = 1. Thus, rm(v|S)≠rm (uk|S).
6. For uk, i ∈ V ((Fn)k) and p + 1 ≤ i ≤ p + 3. Since d (uk, p+1, w)≠d (uk, p+2, w) where w ∈ S − Wk and d (uk, p+1, w)≠d (uk, p+2, w) where w ∈ Wk such that rm (uk, p+1|S)≠rm (uk, p+2|S). Since d (uk, p+2, w) = d (uk, p+3, w) where w ∈ S − Wk and d (uk, p+2, w)≠d (uk, p+3, w) where w ∈ Wk such that rm (uk, p+2|S)≠rm (uk, p+3|S).
7. For uk, i ∈ V ((Fn)k) where p + 4l + 1 ≤ i ≤ p + 4l + 3 and . Since d (uk, p+4l+1, w)≠d (uk, p+4l+2, w) where w ∈ S − Wk and d (uk, p+4l+1, w)≠d (uk, p+4l+2, w) where w ∈ Wk such that rm (uk, p+4l+1|S)≠rm (uk, p+4l+2|S). Since d (uk, p+4l+2, w) = d (uk, p+4l+3, w) where w ∈ S − Wk and d (uk, p+4l+2, w)≠d (uk, p+4l+3, w) where w ∈ Wk such that rm (uk, p+4l+2|S)≠rm (uk, p+4l+3|S).
Based on the representation above that every two adjacent vertices has distinct representations such that S is a local m-resolving set and .
Furthermore, we will show that . Take any S ⊂ V (Amal (Fn, v, m)) with|P|<|S|. Suppose . There are one copies of Fn, (Fn)k have .
1. Let uk,l ∉ P for p + 1 < l ≤ n − 1 or l ≡ p + 4s with and d (uk, p+4(s−1)+1, uk, p+4(s+1)−1) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
2. Let uk,l ∉ P for 1 < l ≤ p − 1 or l ≡ 1(mod4) and p ≡ 1(mod4), then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
Thus, .
For n − p ≡ 3(mod4)
We have some conditions for the set S as follows
a for p ≡ 1(mod4), S = {uj, t;1 ≤ j ≤ m, t ≡ 1(mod4)}∪{uj,r;1 ≤ j ≤ m, r ≡ p (mod4), r > p}∪{uj,n−1}.
b for p ≡ 2(mod4), S = {uj, t;1 ≤ j ≤ m, t ≡ 2(mod4)}∪{uj,r;1 ≤ j ≤ m, r ≡ p (mod4), r > p}∪{uj,n−1}.
c for p ≡ 3(mod4), S = {uj, t;1 ≤ j ≤ m, t ≡ 3(mod4)}∪{uj,r;1 ≤ j ≤ m, r ≡ p (mod4), r > p}∪{uj,n−1}.
d for p ≡ 0(mod4), S = {uj, t;1 ≤ j ≤ m, t ≡ 0(mod4)}∪{uj,r;1 ≤ j ≤ m, r ≡ p (mod4), r > p}∪{uj,n−1}.
We obtained the vertex representation as follows:
1. For uk, i ∈ V ((Fn)k) where p − 3 ≤ i ≤ p − 1 and p ≡ 0, 1, 2, 3(mod4). Since d (uk, p−1, w)≠d (uk, p−2, w) where w ∈ S − Wk and d (uk, p−1, w)≠d (uk, p−2, w) where w ∈ Wk such that rm (uk, p−1|S)≠rm (uk, p−2|S). Since d (uk, p−2, w) = d (uk, p−3, w) where w ∈ S − Wk and d (uk, p−2, w)≠d (uk, p−3, w) where w ∈ Wk such that rm (uk, p−2|S)≠rm (uk, p−3|S).
2. For uk, i ∈ V ((Fn)k) where p − 4l + 1 ≤ i ≤ p − 4l + 3, , and ap ≡ 0, 1, 2, 3(mod4). Since d (uk,p−4l+1, w)≠d (uk, p−4l+2, w) where w ∈ S − Wk and d (uk, p−4l+1, w)≠d (uk, p−4l+2, w) where w ∈ Wk such that rm (uk, p−4l+1|S)≠rm (uk, p−4l+2|S). Since d (uk, p−4l+2, w) = d (uk, p−4l+3, w) where w ∈ S − Wk and d (uk, p−4l+2,w)≠d (uk, p−4l+3, w) where w ∈ Wk such that rm (uk, p−4l+2|S)≠rm (uk, p−4l+3|S).
3. For uk,l ∈ V (Amal (Fn, v, m)) and 1 ≤ l ≤ p − 1, d (uk,1, w)≠d (uk,2, w) where w ∈ S − Wk such that rm (uk,1|S − Wk)≠rm (uk,2|S − Wk). Since d (uk,1, w) = d (uk,2, w) where w ∈ Wk such that rm (uk,1|Wk)≠rm (uk,2|Wk). Thus, rm (uk,1|S)≠rm (uk,2|S).
4. For uk, v ∈ V (Amal (Fn, v, m)), d(v, w)≠d (uk, w) where w ∈ S − Wk such that rm(v|S − Wk)≠rm (uk|S − Wk). Since d(v, w)≠d (uk, w) where w ∈ Wk such that rm(v|Wk)≠rm (uk|Wk). Thus, rm(v|S)≠rm (uk|S).
5. For uk, uk,l ∈ V ((Fn)k) where l≠p (mod4) and uk,l where l≠n − 2 for n − p ≡ 3(mod4). Since uk adjacent to w where w ∈ Wk, such that rm (uk|Wk)≠rm (uk,l|Wk). Since d (uk, w)≠d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk)≠rm (uk,l|S − Wk) with l≠1. Since d (uk, w) = d (uk,l, w) where w ∈ S − Wk such that rm (uk|S − Wk) = rm (uk,l|S − Wk) with l = 1. Thus, rm(v|S)≠rm (uk|S).
6. For uk, i ∈ V ((Fn)k) and p + 1 ≤ i ≤ p + 3. Since d (uk, p+1, w)≠d (uk, p+2, w) where w ∈ S − Wk and d (uk, p+1, w)≠d (uk, p+2, w) where w ∈ Wk such that rm (uk, p+1|S)≠rm (uk, p+2|S). Since d (uk, p+2, w) = d (uk, p+3, w) where w ∈ S − Wk and d (uk, p+2, w)≠d (uk, p+3, w) where w ∈ Wk such that rm (uk, p+2|S)≠rm (uk, p+3|S).
7. For uk, i ∈ V ((Fn)k) where p + 4l + 1 ≤ i ≤ p + 4l + 3 and . Since d (uk, p+4l+1, w)≠d (uk, p+4l+2, w) where w ∈ S − Wk and d (uk, p+4l+1, w)≠d (uk, p+4l+2, w) where w ∈ Wk such that rm (uk, p+4l+1|S)≠rm (uk, p+4l+2|S). Since d (uk, p+4l+2, w) = d (uk, p+4l+3, w) where w ∈ S − Wk and d (uk, p+4l+2, w)≠d (uk, p+4l+3, w) where w ∈ Wk such that rm (uk, p+4l+2|S)≠rm (uk, p+4l+3|S).
8. For uk, i ∈ V ((Fn)k) where i = n − 2, n. Since uk,n−2 does not adjacent to uk, n. It is clear.
Based on the representation above that every two adjacent vertices have distinct representations such that S is a local m-resolving set and .
Furthermore, we will show that . Take any S ⊂ V (Amal (Fn, v, m)) with|P|<|S|. Suppose . There are one copies of Fn, (Fn)k have . There are three possibilities namely 1) uk,l ∉ P for 1 < l < n − 1 and 2) uk,n−1 ∉ P.
1. Let uk,l ∉ P for 1 < l ≤ n − 1 or l ≡ p + 4s with and d (uk, p+4(s−1)+1, uk, p+4(s+1)−1) > 4, then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
2. Let uk,n−1 ∉ P. Since . Since d (uk,n−1, w) = d (uk, n, w) for w ∈ P − Wk and rm (uk,n−1|P) = rm (uk, n|P), then P is not local m-resolving set of Amal (Fn, v, m).
3. Let uk,l ∉ P for 1 < l ≤ p − 1 or l ≡ 1(mod4) and p ≡ 1(mod4), then . Since for w ∈ P − Wk and , then P is not local m-resolving set of Amal (Fn, v, m).
Based on 1), 2) and 3) that . Thus, . □
We have characterized the local multiset dimension of amalgamation graphs. We have found the upper bound of local multiset dimension and determined the exact value of local multiset dimension of path Pn, complete graph Kn, wheel graph Wn, and fan graph Fn. There are some graphs that attain the upper bound of local multiset dimension namely wheel graphs. On the otherhand, we found the following problem, as follows.
Open Problem 0.1 Determine the lower bound of local multiset dimension of amalgamation graphs.
We gratefully acknowledge the support from Universitas Airlangga and University of Jember of year 2022.
Views | Downloads | |
---|---|---|
F1000Research | - | - |
PubMed Central
Data from PMC are received and updated monthly.
|
- | - |
Competing Interests: No competing interests were disclosed.
Reviewer Expertise: Graph theory. Discrete Mathematics, Chemical graph Theory, Combinatorics
Is the work clearly and accurately presented and does it cite the current literature?
Yes
Is the study design appropriate and is the work technically sound?
Yes
Are sufficient details of methods and analysis provided to allow replication by others?
Yes
If applicable, is the statistical analysis and its interpretation appropriate?
Yes
Are all the source data underlying the results available to ensure full reproducibility?
Partly
Are the conclusions drawn adequately supported by the results?
Yes
References
1. Zhang X, Wu X, Akhter S, Jamil M, et al.: Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices of Generalized Bridge Molecular Graphs. Symmetry. 2018; 10 (12). Publisher Full TextCompeting Interests: No competing interests were disclosed.
Reviewer Expertise: Graph theory. Discrete Mathematics, Chemical graph Theory, Combinatorics
Is the work clearly and accurately presented and does it cite the current literature?
Yes
Is the study design appropriate and is the work technically sound?
Yes
Are sufficient details of methods and analysis provided to allow replication by others?
Yes
If applicable, is the statistical analysis and its interpretation appropriate?
Not applicable
Are all the source data underlying the results available to ensure full reproducibility?
No source data required
Are the conclusions drawn adequately supported by the results?
Yes
Competing Interests: No competing interests were disclosed.
Reviewer Expertise: Graph theory, number theory, discrete group theory, Molecular graphs
Alongside their report, reviewers assign a status to the article:
Invited Reviewers | ||
---|---|---|
1 | 2 | |
Version 2 (revision) 23 Apr 24 |
read | |
Version 1 24 Jan 23 |
read | read |
Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list:
Sign up for content alerts and receive a weekly or monthly email with all newly published articles
Already registered? Sign in
The email address should be the one you originally registered with F1000.
You registered with F1000 via Google, so we cannot reset your password.
To sign in, please click here.
If you still need help with your Google account password, please click here.
You registered with F1000 via Facebook, so we cannot reset your password.
To sign in, please click here.
If you still need help with your Facebook account password, please click here.
If your email address is registered with us, we will email you instructions to reset your password.
If you think you should have received this email but it has not arrived, please check your spam filters and/or contact for further assistance.
Comments on this article Comments (0)