Local Antimagic Chromatic Number for Copies of Graphs

: An edge labeling of a graph G = ( V , E ) using every label from the set { 1,2, . . . , | E ( G ) |} exactly once is a local antimagic labeling if the vertex-weights are distinct for every pair of neighboring vertices, where a vertex-weight is the sum of labels of all edges incident with that vertex. Any local antimagic labeling induces a proper vertex coloring of G where the color of a vertex is its vertex-weight. This naturally leads to the concept of a local antimagic chromatic number. The local antimagic chromatic number is deﬁned to be the minimum number of colors taken over all colorings of G induced by local antimagic labelings of G . In this paper, we estimate the bounds of the local antimagic chromatic number for disjoint union of multiple copies of a graph. Author Contributions: Conceptualization, M.B., A.S.-F. and T.-M.W.; methodology, M.B., A.S.-F. and T.-M.W.; validation, M.B., A.S.-F. and T.-M.W.; investigation, M.B., A.S.-F. and T.-M.W.; resources, M.B., A.S.-F. and T.-M.W.; writing—original draft preparation, A.S.-F.; writing—review and editing, M.B., A.S.-F. and T.-M.W.; supervision, A.S.-F.; project administration, M.B., A.S.-F. and T.-M.W.;


Introduction
In this paper, we will consider only finite graphs without loops or multiple edges. For graph theoretic terminology we refer to the book by Chartrand and Lesniak [1].
An antimagic labeling of a graph G = (V, E) is a bijection f from the set of edges of G to the integers {1, 2, . . . , |E(G)|} such that all vertex-weights are pairwise distinct, where a vertex-weight is the sum of labels of all edges incident with that vertex, i.e., for the vertex u ∈ V(G) the weight wt(u) = ∑ uv∈E(G) f (uv). A graph is called antimagic if it admits an antimagic labeling.
The concept of antimagic labeling was introduced by Hartsfield and Ringel [2] who conjectured that every simple connected graph, other than K 2 , is antimagic. This conjecture is still open although for some special classes of graphs it was proved, see for instance [3][4][5][6][7][8]. Alon et al. [9] proved that large dense graphs are antimagic. Hefetz et al. [10] proved that any graph on p k vertices that admits a C p -factor, where p is an odd prime and k is a positive integer, is antimagic. Perhaps the most remarkable result to date is the proof for regular graphs of odd degree given by Cranston et al. in [11], which was subsequently adapted to regular graphs of even degree by Bércz et al. in [12] and by Chang et al. in [13].
Recently, two groups of authors in [14,15] independently introduced a local antimagic labeling as local version of the Hartsfield and Ringel's concept of antimagic labeling. An edge labeling using every label from the set {1, 2, . . . , |E(G)|} exactly once is a local antimagic labeling if the vertex-weights wt(u) and wt(v) are distinct for every pair of neighboring vertices u, v.
In [14] authors conjectured that any connected graph other than K 2 admits a local antimagic labeling. Bensmail et al. [15] propose the slightly stronger form of the previous conjecture that every graph without component isomorphic to K 2 has a local antimagic labeling. This conjecture was proved by Haslegrave [16] using the probabilistic method.
Any local antimagic labeling induces a proper vertex coloring of G where the vertexweight wt(u) is the color of u. This naturally leads to the concept of a local antimagic chromatic number introduced in [14]. The local antimagic chromatic number χ la (G) is defined to be the minimum number of colors taken over all colorings of G induced by local antimagic labelings of G.
For any graph G, χ la (G) ≥ χ(G), where χ(G) is the chromatic number of G as the minimum number of colors needed to produce a proper coloring of G. In [14] is investigated the local antimagic chromatic number for paths, cycles, friendship graphs, wheels and complete bipartite graphs. Moreover, there is proved that for any tree T with l leaves χ la (T) ≥ l + 1.
In this paper, we investigate the local antimagic chromatic number for disjoint union of multiple copies of a graph G, denoted by mG, m ≥ 1, and we present some estimations of this parameter.
Please note that G does not have to be necessarily connected. By the symbol x i we denote the element (vertex or edge) corresponding to the element (vertex or edge) x in the ith copy of G in mG, i = 1, 2, . . . , m.

Graphs with Vertices of Even Degrees
A graph G is called equally 2-edge colorable if it is possible to color its edges with two colors c 1 , c 2 such that for every vertex v ∈ V(G) the number of edges incident to the vertex v colored with color c 1 is the same as the number of edges incident to the vertex v colored with color c 2 . This means that for any vertex denotes the number of edges incident to the vertex v and colored with color c i , i = 1, 2. Trivially, if a graph G is equally 2-edge colorable then all vertices in G have even degrees.
Consider that G is an even regular graph. Then there exists an Euler circle in G. If we alternatively color the edges in the Euler circle with colors c 1 and c 2 we obtain that either for every vertex v in G holds n 1 (v) = n 2 (v), or there exists exactly one vertex in G, say w, such that n 1 (w) = n 2 (w) + 2.
Consider a 2-edge coloring c of a graph G. Let c(G) denote the number of vertices in G such that n 1 c (v) = n 2 c (v) under the labeling c. In this case we say that c is a c(G)-equally 2-edge coloring of G.
Let c be any 2-edge coloring of G. Let f be any bijective mapping in G, f : E(G) → {1, 2, . . . , |E(G)|}. We define an edge labeling g of mG, m ≥ 1 in the following way If an edge in G is labeled with the number t, 1 ≤ t ≤ |E(G)|, then the corresponding edges in mG are labeled with numbers from the set {m(t − 1) + 1, m(t − 1) + 2, . . . , mt}. Thus we immediately obtain that the labeling g is a bijective mapping that assigns numbers 1, 2, . . . , m|E(G)| to the edges of mG.
Moreover, for the weight of the vertex v i , i = 1, 2, . . . , m, in mG under the labeling g we obtain the following Thus, for every vertex v ∈ V(G) such that n 1 for i = 1, 2, . . . , m. This means that the corresponding vertices in different copies have the same weights. Summarizing the previous we obtain the following lemma that will be used later. Immediately from the previous result we obtain the following theorem for equally 2-edge colorable graphs. Theorem 1. Let m be a positive integer. Let G be an equally 2-edge colorable graph and let f be a local vertex antimagic edge labeling of G that uses χ la (G) colors. Let for every edge uv ∈ E(G) be Then Proof. Let f be a local vertex antimagic edge labeling of G that uses χ la (G) colors. Let c be an equally 2-edge coloring of G. This means that for every vertex v ∈ V(G) is n 1 (v) = n 2 (v) = deg(v)/2. According to Lemma 1 and Equality (1) we obtain that there exists a labeling g of mG, m ≥ 1, such that for every v ∈ V(G) and every i = 1, 2, . . . , m holds wt g (v i ) = m · wt f (v) + (1 − m) deg(v)/2. Thus, g is such labeling that the corresponding vertices in different copies have the same weights. If for all adjacent vertices u, v ∈ V(G) holds then also all adjacent vertices in mG have distinct weights. Moreover, χ la (mG) ≤ χ la (G). This concludes the proof.
Note, if G is a regular graph then the condition (2) trivially holds. Results in the next two theorems are based on the Petersen Theorem.

Proposition 1. (Petersen Theorem)
Let G be a 2r-regular graph. Then there exists a 2-factor in G.
Notice that after removing edges of the 2-factor guaranteed by Petersen Theorem we have again an even regular graph. Thus, by induction, an even regular graph has a 2-factorization. Theorem 2. Let G be a 4r-regular graph, r ≥ 1. Then for every positive integer m Proof. Let G be a 4r-regular graph. According to Petersen Theorem G is decomposable into 2-factors F 1 , F 2 , . . . , F 2r . Consider an edge coloring c of G defined such that Evidently, c is an equally 2-edge coloring of G. Thus, immediately according to Theorem 1 we obtain the desired result.
Theorem 3. Let G be a (4r + 2)-regular graph, r ≥ 0, containing a 2-factor consisting only from even cycles. Then for every positive integer m Proof. Let G be a (4r + 2)-regular graph containing a 2-factor consisting only from even cycles. Denote this 2-factor by F 1 . Let us denote the edges in component F 1 by the symbols e 1 , e 2 , . . . , e |VG| arbitrarily in such a way that all cycles in F 1 are of the form e s e s+1 e s+2 . . . e s+t , where s, t are odd integers. As all cycles in F 1 are even, evidently every vertex in G is incident with an edge in F 1 with an even and also with an odd index. According to Petersen Theorem the graph G − F 1 is decomposable into 2-factors F 2 , F 3 , . . . , F 2r+1 . Consider an edge coloring c of G defined such that It is easy to see that for every vertex v ∈ V(G) holds This means that c is an equally 2-edge coloring of G. By Theorem 1 we obtain that χ la (mG) ≤ χ la (G). Corollary 1. Let n, m be positive integers, n ≥ 2, m ≥ 1. Then Proof. In [14] it was proved that χ la (C k ) = 3 for every k ≥ 3. According to Theorem 3 we obtain that if k = 2n then for every positive integer m holds χ la (mC 2n ) ≤ 3. Now suppose there exists a local antimagic labeling f that induces a 2-coloring C of mC 2n , i.e., the set of the vertex weights consists of two numbers C 1 and C 2 . As every edge label contributes exactly once to the vertex weight of a vertex colored C 1 we obtain However, every edge label contributes also exactly once to the vertex weight of a vertex colored C 2 thus mn · C 2 = 1 + 2 + · · · + 2nm.
Please note that a cycle C 2n+1 is 1-equally 2-edge colorable. It is possible to generalize the results from the previous section also for c(G)-equally 2-edge colorable graphs. If we are able to guarantee that for every edge uv ∈ E(G) is then we can prove that This condition is fulfilled for some graphs containing pendant vertices, thus also for some trees.

Lemma 2.
Let G be a graph with l leaves, l ≥ 0. Then Proof. The proof is similar to the proof in [14]. Let f be any local antimagic labeling of a graph G. Then in the coloring induced by f , the color of a leaf v is f (uv), where uv ∈ E(G). Hence all the leaves receive distinct colors. Moreover, for any non-leaf w incident with an edge e with f (e) = |E(G)|, the color assigned to w is larger than |E(G)|. Hence the number of colors in the coloring induced by f is at least l + 1.
Theorem 5. Let G be a graph without a component isomorphic to K 2 such that all vertices in G but leaves have the same even degree. If there exists a 2-edge coloring c of G such that for all vertices v but leaves holds n 1 where m is a positive integer and l is the number of leaves in G.
Proof. Let G be a graph without a component isomorphic to K 2 such that all its vertices but leaves have the same even degree 2r. Let c be a 2-edge coloring of G such that for all vertices v in G but leaves holds n 1 c (v) = n 2 c (v) = deg(v)/2 = r. Let f be any local antimagic labeling of a graph G that uses χ la (G) colors. Then using Equality (1) we obtain that there exists an edge labeling g of mG, m ≥ 1, such that the weights of non-leaf vertices v i , i = 1, 2, . . . , m, corresponding to a vertex v in G, are This means that the weights of corresponding non-leaf vertices in every copy of G are the same. However, this also means that the adjacent non-leaf vertices in mG have distinct weights. Now consider the edges w i u i , i = 1, 2, . . . , m, where w is a leaf. For i = 1, 2, . . . , m trivially holds Which means that all adjacent vertices have distinct weights. Combining the previous arguments we obtain The lower bound for χ la (mG) follows from Lemma 2.

Trees
If the graph in Theorem 5 is a forest we immediately obtain the following result. Theorem 6. Let T be a forest with no component isomorphic to K 2 such that all vertices but leaves have the same even degree. Then where m is a positive integer and l is the number of leaves in T.
Proof. Trivially, any graph containing K 2 as a component cannot be local antimagic. Let T be a forest with no component isomorphic to K 2 such that all vertices but leaves have the same even degree 2r. Clearly there exists a 2-edge coloring c of T such that for all vertices v but leaves hold n 1 c (v) = n 2 c (v) = deg(v)/2 = r. Thus, according to Theorem 5 we are done.
Immediately from the previous theorem we obtain the result for copies of paths and copies of some stars as χ la (P n ) = 3 for n ≥ 3 and χ la (K 1,n ) = n + 1 for n ≥ 2, see [14].

Corollary 2.
Let P n be a path on n vertices, n ≥ 3. Then for every positive integer m, m ≥ 1, holds χ la (mP n ) = 2m + 1.
We consider two cases according to the parity of m. Case 1: when m is odd. We define an edge labeling g of mK 1,2n+1 in the following way if j = 1 and i = 1, 2, . . . , m, Evidently g is a bijection and the induced weights of the vertices w i , i = 1, 2, . . . , m, are As all vertices of degree 2n + 1 have the same weights and the weights of the leaves are distinct we obtain χ la (mK 1,2n+1 ) ≤ (2n + 1)m + 1. The lower bound follows from Lemma 2. According to the properties of the labeling g, the labeling f is a bijective mapping that assigns numbers 1, 2, . . . , m(2n + 1) to the edges of mK 1,2n+1 . The weights of vertices w i , i = 2, 3, . . . , m, are all the same as The weight of the vertex w 1 is If the weight of the vertex w 1 under the labeling f is the same as the weight of some leaf, we obtain that χ la (mK 1,2n+1 ) ≤ (2n + 1)m + 1. This is satisfied when (n + 1)(2n + 1) ≤ m(2n + 1), that is if n + 1 ≤ m. The equality χ la (mK 1,2n+1 ) = (2n + 1)m + 1 holds because the number of induced colors must be greater then the number of leaves, see Lemma 2. Now consider that the weight of the vertex w 1 under the labeling f is greater then the weight of all leaves, i.e., n + 1 > m. Then labeling f induces (2n + 1)m + 2 colors for vertices. To prove that it is not possible to obtain (2n + 1)m + 1 colors it is sufficient to consider the fact, that the weight of any vertex of degree 2n + 1 is at least the sum of numbers 1, 2, . . . , 2n + 1, thus it is at least (n + 1)(2n + 1). However, the weights of leaves are at most (2n + 1)m. Thus if there exists an edge labeling that induces (2n + 1)m + 1 colors for vertices, under this labeling all vertices w i , i = 1, 2, . . . , m must have the same color/weight, say c(w). However, in this case the sum of all edge labels must be equal to m multiple of c(w), as every edge label contributes exactly once the weight of a vertex of degree 2n + 1. Thus mc(w) = 1 + 2 + · · · + (2n + 1)m which implies 2c(w) =(2n + 1)((2n + 1)m + 1).
However, this is a contradiction as for m even the right side of the previous equation is odd. This means that in this case χ la (mK 1,2n+1 ) = (2n + 1)m + 2.
Please note that Theorem 6 can be extended also for other trees (forests) such that their non-leaf vertices have even degrees, not necessarily the same. We just need to guarantee that the adjacent non-leaf vertices will have distinct weights. For some trees, for example for spiders, we are able to do it. A spider graph is a tree with exactly one vertex of degree greater than 2. By S(n 1 , n 2 , . . . , n l ), 1 ≤ n i ≤ n i+1 , i = 1, 2, . . . , l − 1, l ≥ 3, we denote a spider obtained by identifying one leaf in paths P n i +1 , i = 1, 2, . . . , l. In [17] was proved that if n 1 = 1 then χ la (S(n 1 , n 2 , . . . , n l )) = l + 1 and if n 1 ≥ 2 then χ la (S(n 1 , n 2 , . . . , n l )) ≤ l + 2. Moreover, for l ≥ 4 the described edge labeling induces for the root vertex, the vertex of degree l, the largest weight over all other vertex weights. Using the presented results we obtain Theorem 8. Let S(n 1 , n 2 , . . . , n l ) be a spider graph. If l is even, l ≥ 4, and n 1 = 1 χ la (mS(n 1 , n 2 , . . . , n l )) = ml + 1.
In [18] was proposed the following conjecture.
In the light of the previous results trees, for copies of trees we conjecture Theorem 10. Let T be a tree other than K 2 with l leaves. Then for every positive integer m, m ≥ 1, ml + 1 ≤ χ la (mT) ≤ ml + 2.

Graphs with Chromatic Index 3
In this section we will deal with 3-regular graphs that admit a proper 3-edge coloring.
Proof. Let c be a proper 3-edge coloring of G. Let f be a local vertex antimagic edge labeling of G that uses χ la (G) colors. We define a new labeling g of mG, for m odd, in the following way. It is easy to see that if an edge in G is labeled with the number t, 1 ≤ t ≤ |E(G)|, then the corresponding edges in mG are labeled with numbers from the set {m(t − 1) + 1, m(t − 1) + 2, . . . , mt}. Thus, g is a bijection that assigns numbers 1, 2, . . . , m|E(G)| to the edges of mG. Now we will calculate a vertex weight of the vertex v i in mG. Let x, y and z be the vertices adjacent to v in G. Without loss of generality we can assume that c(xv) = c 1 , c(yv) = c 2 and c(zv) = c 3 . Then for i = 1, 2, . . . , (m − 1)/2 we obtain If i = (m + 1)/2, (m + 3)/2, . . . , m then Thus, in all copies the corresponding vertices have the same weights. Moreover, as the set of weights of vertices in G under the labeling f consists of χ la (G) distinct numbers we immediately obtain that also the set of weights of vertices in mG under the labeling g consists of χ la (G) distinct numbers. Thus, χ la (mG) ≤ χ la (G).
Analogously, as it was possible to extend the results in Section 2 for graphs with leaves, we can also extend Theorem 11 for some graphs with pendant vertices. Theorem 12. Let G be a graph such that all vertices but leaves have degree 3. If there exists a 3-edge coloring c of G such that for all vertices v but leaves hold n 1 c (v) = n 2 c (v) = n 3 c (v) = 1, then for every odd positive integer m, m ≥ 1, where l is the number of leaves in G.
Proof. Let G be a graph such that all its vertices but leaves have degree 3. Let c be a 3-edge coloring of G such that for all vertices v in G but leaves hold n 1 c (v) = n 2 c (v) = n 3 c (v) = 1. Let f be any local antimagic labeling of a graph G that uses χ la (G) colors. Then using Equality (4) we obtain that there exists an edge labeling g of mG, m odd m ≥ 1, such that the weights of non-leaf vertices v i , i = 1, 2, . . . , m, corresponding to a vertex v in G, are This means that the weights of corresponding non-leaf vertices in every copy of G are the same. However, this also means that the adjacent non-leaf vertices in mG have distinct weights. Now consider the edges w i u i , i = 1, 2, . . . , m, where w is a leaf. Trivially holds Which means that all adjacent vertices have distinct weights. Combining the previous arguments we obtain The lower bound for χ la (mG) follows from Lemma 2.
Immediately for forests we obtain the following result.

Corollary 4.
Let T be a forest such that all its vertices but leaves have degree 3. Then for every odd positive integer m, m ≥ 1 holds where l is the number of leaves in T.
Proof. Let T be a forest such that all its vertices but leaves have degree 3. Trivially there exists a 3-edge coloring c of T such that for all vertices v but leaves hold n 1 c (v) = n 2 c (v) = n 3 c (v) = 1. Using Theorem 12 we obtain the desired result.
The next theorem shows how it is possible to extend the previous result for regular graphs that are decomposable into spanning subgraphs that are all isomorphic either to even regular graphs or 3-regular graphs.
Theorem 13. Let G be a graph that can be decomposed into factors G 1 , G 2 , . . . , G k , k ≥ 1, and let every factor G i , i = 1, 2, . . . , k, be isomorphic to a graph of the following types: type I: a 4-regular graph, type II: a 2-regular graph consisting of even cycles, type III: a 3-regular graph with chromatic index 3.
If every factor G i , i = 1, 2, . . . , k, is of type I or of type II then for every positive integer m, m ≥ 1, holds If at least one factor G i , i = 1, 2, . . . , k, is of type III then for every odd positive integer m, m ≥ 1, holds χ la (mG) ≤ χ la (G).
Please note that the exact value of χ la (K n ) is n, since χ la (K n ) ≥ χ(K n ) = n. Immediately from the previous theorem we obtain the following result for complete graphs K n . Corollary 5. Let K n be a complete graph on n vertices, n ≥ 4. If n ≡ 1 (mod 4) then for every positive integer m, m ≥ 1, and if n ≡ 0 (mod 4) then for every odd positive integer m, m ≥ 1, we have χ la (mK n ) = n.

Conclusions
One interesting problem is to find a local antimagic chromatic number for disjoint union of arbitrary graphs. According to results proved by Haslegrave [16] we obtain that this parameter is finite for disjoint union of arbitrary graphs if and only if non of these graphs contains an isolated edge as a subgraph. Moreover, Haslegrave [16] proved the following result. Theorem 14. Ref. [16] For every graph G with m edges, none of which is isolated, and for any positive integer k, the edges of G may be labeled with a permutation of {k, k + 1, . . . , m + k − 1} in such a way that the vertex sums distinguish all pairs of adjacent vertices.
Immediately from this result we obtain an upper bound for a local antimagic chromatic number for disjoint union of arbitrary graphs.
Theorem 15. Let G i , i = 1, 2, . . . , n, be a graph with no isolated edge. Then For some graphs we can obtain a better upper bound. Theorem 16. Let G i , i = 1, 2, be a graph with no isolated edge. Let G 2 be a graph such that all vertices but leaves have the same degree. Then where l 2 is the number of leaves in G 2 .
Proof. Let G 2 be a graph such that all vertices but leaves have the same degree r, r ≥ 2 and let l 2 be the number of leaves in G 2 . Let f i , i = 1, 2, be a local vertex antimagic edge labeling of G i that uses χ la (G i ) colors. We define an edge labeling g of G 1 ∪ G 2 such that g(e) = f 1 (e), if e ∈ E(G 1 ), f 2 (e) + |E(G 1 )|, if e ∈ E(G 2 ).
As f 1 and f 2 are bijections evidently also g is a bijection. For the vertex weights under the labeling g we obtain the following. If v ∈ V(G 1 ) then Thus, the weights of adjacent vertices in G 1 are distinct and they induce χ la (G 1 ) colors.
If v ∈ V(G 2 ) and deg G 2 (v) = 1 then This means that also the weights of adjacent vertices in G 2 are distinct. Moreover, we obtain that the labeling g induces at most χ la (G 2 ) + l 2 colors as the number of colors assigned to the vertices of degree at least 2 is the same and all the leaves could be assigned with the colors different from the colors of non leaves. Combining the previous we obtain that the labeling g induces at most χ la (G 1 ) + χ la (G 2 ) + l 2 colors.
Proof. Let G be a graph with no isolated edge and with l leaves. The lower bound follows from Lemma 2. The upper bound is based on the fact that there exists a local antimagic labeling of mP 3 that induces 2m + 1 colors such that the color of every vertex of degree 2 in mP 3 will have the same color 2m + 1. Thus, the labeling g of mP 3 ∪ G described in the proof of Theorem 16 induces also 2m + 1 colors for vertices in mP 3 . These colors are |E(G)| + 1, |E(G)| + 2, . . . , |E(G)| + 2m and 2|E(G)| + 2m + 1. In general, these colors are distinct from colors of vertices in G 1 induced by the labeling g. This concludes the proof.