The integer-antimagic spectra of Hamiltonian graphs

Let A be a nontrivial abelian group. A connected simple graph G = (V,E) is A-antimagic, if there exists an edge labeling f : E(G) → A\{0A} such that the induced vertex labeling f(v) = ∑ {u,v}∈E(G) f({u, v}) is a one-to-one map. The integer-antimagic spectrum of a graphG is the set IAM(G) = {k : G is Zk-antimagic and k ≥ 2}. In this paper, we determine the integer-antimagic spectra for all Hamiltonian graphs.


Introduction
A labeling of a graph is defined to be an assignment of values to the vertices and/or edges of the graph. Graph labeling is a very diverse and active field of study. A dynamic survey [2] maintained by Gallian contains 2922 references to research papers and books on the topic.
Let G be a connected simple graph. For any nontrivial abelian group A (written additively), let A * = A\{0 A }, where 0 A is the additive identity of A. Let function f : E(G) → A * be an edge labeling of G. Any such labeling induces a vertex labeling f + : V (G) → A, defined by f + (v) = {u,v}∈E(G) f ({u, v}). We denote the range of f + by R f (G). If there exists an edge labeling f whose induced map f + on V (G) is one-to-one, we say that f is an A-antimagic labeling and that G is an A-antimagic graph. The integer-antimagic spectrum of a graph G is the set IAM(G) = {k : G is Z k -antimagic and k ≥ 2}.
The concept of the A-antimagicness property for a graph G (introduced independently in [1,3]) naturally arises as a variation of the A-magic labeling problem (where the induced vertex labeling is a constant map). There is a large body of research on A-magic graphs within the mathematical literature. As for A-antimagic graphs (which is the focus of our paper), cycles, paths, various classes of trees, dumbbells, graphs with a chord, multi-cyclic graphs, K m,n , K m,n − {e}, tadpoles and lollipop graphs were investigated in [1,3,4,5,7,8,9].
First, we include some known results which will be used in the rest of the paper. In particular, the results from the theorems in this section are used in the constructions of new Z k -antimagic labelings in this paper.
A trivial lower bound for the least element of IAM(G) is the order of G. However, this is not always achieved, as seen in the following result.
Motivation for our current work is found in the following conjecture.
A result of Jones and Zhang [3] finds the minimum element of IAM(G) for all connected graphs on 3 or more vertices. In their paper, a Z n -antimagic labeling of a graph on n vertices is referred to as a nowhere-zero modular edge-graceful labeling. This is a variation of a graceful labeling (originally called a β-valuation) which was introduced by Rosa [6] in 1967. The result is as follows, where the terminology has been adapted to better suit this paper. 3]). If G is a connected simple graph of order n ≥ 3, then min{t : t ∈ IAM(G)} ∈ {n, n + 1, n + 2}. Furthermore, • min{t : t ∈ IAM(G)} = n if and only if n ≡ 2 (mod 4), G = K 3 , and G is not a star of even order; • min{t : t ∈ IAM(G)} = n + 1 if and only if G = K 3 or n ≡ 2 (mod 4) and G is not a star of even order; and • min{t : t ∈ IAM(G)} = n + 2 if and only if G is a star of even order.
Conjecture 1 was shown to be true for all of the classes of graphs which were analyzed in [1,4,5,7,8,9]. The purpose of this paper is to provide additional evidence for Conjecture 1 by verifying it for a large family of graphs including all Hamiltonian graphs. We use constructive methods to determine the integer-antimagic spectra of the graph classes in question.
If  i , v i+1 }, to be the function g x : E(C m ) → {x, −x} such that g x ({v i , v i+1 }) = x and g x alternates between −x and x, where x ∈ A for some additive group A.
We will make use of the following result in our main construction.

Graphs with an even cycle
The following technical lemma is important and will be used throughout this paper.
Thus by the Pigeonhole Principle, we may assume that there exists x ∈ Z k \{0} with the following properties: . . , k − 1} and its additive inverse at least once. In this case, we where addition is in Z k and Here, g x is the x-alternating cycle labeling of the cycle C m starting with the only edge e * , for which f (e * ) = x; otherwise, if f (e) = x for all e ∈ E(C m )\{u, v}, then g x can start at any edge in the cycle. Clearly, w Example 1. This example demonstrates how the overlaying of an alternating cycle labeling works (see f , h, and x found in the proof of Lemma 2.1). Let f : E(C 12 ) → Z k \{0} be a Z k -antimagic labeling of C 12 as shown in Figure 1(a), and h : E(C 12 ) → Z k \{0} be the labeling of C 12 defined by h(e) = f (e) + g(e) as shown in Figure 1(b) where g is the x-alternating cycle labeling of the cycle C 12 . It is clear that, for x ∈ {1, 3, 8, 10}, h is also a Z k -antimagic labeling of C 12 , for k ≥ 12. www.ejgta.org The integer-antimagic spectra of Hamiltonian graphs | Ugur Odabasi et al.  Figure 1. Two different Z k -antimagic labelings of C 12 , for k ≥ 12.

Chorded cycles
Let C m be the cycle (v 0 , v 1 , ..., v m−1 ). A chord of C m is an edge not in E(C m ) whose endpoints lie in the vertex set V (C m ). If C m has at least one chord, then it is called a chorded cycle. We define C m (l) to be the graph obtained from C m by adding the chord {v i , v j }, where l = min{|i − j|, m − |i − j|} which is called the length of the chord. Note that the length of any chord in a cycle C m is at least 2 and at most m 2 . An m-cycle with a chord of length l is denoted by C m (l). Note that C m (l) is the union of two cycles which share exactly one edge -the chord. We call the shorter of the two cycles the minor subcycle of C m (l), denoted by C − m (l), and the longer of the two cycles the major subcycle of C m (l), denoted by C + m (l). In [4], the integer-antimagic spectrum for cycles with a chord was determined completely. In Lemma 2.1, it was shown that Z k -antimagicness can be preserved when an edge is added, provided that edge lies on an even cycle. However, if the added edge lies on only odd cycles, we will make use of Lemmas 3.1 and 3.2. Also by Lemma 3.1, we can obtain an integer-antimagic labeling of a cycle with more than one chord and we will use this result in our main construction.
We will need the following technical lemma for the proof of Lemma 3.2. Proof. Let f : E(C m ) → Z k \{0} be a Z k -antimagic labeling of C m = (v 0 , v 1 , . . . , v m−1 ). Without loss of generality, assume c 1 and c 2 are chords of lengths l 1 and l 2 in C m with end points {v 0 , v l 1 } and {v s , v t }, respectively. Also, we may assume s < t where s, t ∈ Z m . It is easy to check that l 2 = min{t − s, m − t + s} and since l 2 is even, s and t have the same parity. Here, we separate the problem into four cases. Case 1. First, assume s = 0. We define the cycle C = (u 0 , u 1 , . . . , u |l 1 −t|+1 ) in C m , where u 0 = v 0 and u i = v t+sgn(l 1 −t)(i−1) , for i ∈ [1, sgn(l 1 − t)(l 1 − t) + 1]. Here, sgn(·) denotes the signum function. It is obvious that C contains both c 1 = {v 0 , v l 1 } and c 2 = {v 0 , v t } and |V (C)| = |l 1 − t| + 2; that is, C is an even cycle in C m satisfying |V (C)| < m − 1.
Case 2. Let 0 < s < l 1 and define the cycle C = (u 0 , u 1 , . . . , Here, if s = l 1 − 1 and t = m − 1, then C will be a cycle of length m. In this case, we will take the C as the 4-cycle (v 0 , v t , v s , v l 1 ) . It is easy to check that C contains both c 1 = {v 0 , v l 1 } and c 2 = {v s , v t } and |V (C)| = |l 1 − t| + s + 2; that is, C is an even cycle in C m satisfying |V (C)| < m − 1.  In all cases, we are able to find an even cycle C in C m containing both edges c 1 and c 2 which satisfies |V (C)| < m − 1. Since m ≤ k and |V (C)| < m − 1, we have |V (C)| < k − 1. Thus by the Pigeonhole Principle, we may assume that there exists x ∈ Z k \{0} for which x = −x such that at most one of the edges of C\{c 1 , c 2 } is labeled with x while none of which is labeled with −x. Otherwise, the multiset {f (E(C)\{c 1 , c 2 })} would contain every integer x in {1, 2, . . . , k − 1} and its additive inverse at least once, hence, we would have where addition is in Z k and w(e) = g x (e), if e ∈ E(C), 0, otherwise.
Here, g x is the x-alternating cycle labeling of the cycle C starting with the only edge e * , for which f (e * ) = x; otherwise, if f (e) = x for all e ∈ E(C), then g x can start at any edge in the cycle. Clearly, w . Moreover, all the edges of C are labeled with a non-zero integer in Z k since f (e) does not take value −x, for all e ∈ E(C). Thus, h is the desired Z k -antimagic labeling of C m . When two vertices v i and v j (i = j) of the cycle C m are joined by a chord, the resulting graph, say C * m , is always the union of an even cycle and an odd cycle which share one edge {v i , v j }. Thus by Lemma 2.1, C * m is Z k -antimagic for k ≥ m, since the edge {v i , v j } lies on an even cycle in C * m . Whenever an edge is added to the new resulting graph, the added edge belongs to an even cycle. Applying the same construction as in Lemma 2.1 gives a Z k -antimagic graph for k ≥ m.

Hamiltonian graphs of even order
In this section, we determine the integer-antimagic spectra of the Hamiltonian graphs of even order. When we add an even-length chord to an even cycle, both the minor and major subcycles have odd lengths. By applying Theorem 3.1 and Lemma 3.2, we will be able to obtain the desired labelings of Hamiltonian graphs of even order.
Proof. Let C m = (v 0 , v 1 , . . . , v m−1 ) be a Hamiltonian cycle in graph G and let C(G) be the subset of E(G) defined as C(G) = E(G)\E(C m ). We can think of each element of C(G) as a chord of C m . We will construct G by adding chords to the Hamiltonian cycle C m . If the length of a chord is odd, then the corresponding minor subcycle is an even cycle. Thus by Lemma 2.1, regardless how many odd length chords are added to C m , the resulting graph is always Z k -antimagic. Similarly, if the number of even length chords is even, then we can pair up these even length chords and add them to C m as pairs. Thus by Lemma 3.2, this edge addition does not change the groupantimagicness. Lastly, if the number of even length chords is odd, then we first add a single odd length chord to C m , and denote as C * m . By Theorem 3.1, C * m is a Z k -antimagic graph as well. Again, we can pair up the remaining even length chords and keep adding to C * m as pairs until we have G as the resulting graph. By Lemma 3.2, adding a pair of even length chords to a Z k -antimagic graph preserves the group-antimagicness.

Conclusion
Combining the results of Theorems 4.1 and 5.1, we obtain the following main result of this paper.
In addition to Hamiltonian graphs, note that our results in Lemmas 2.1, 3.1, and 3.2 are valid for graphs that contain at least one even cycle as well. These lemmas can be used in analyzing the integer-antimagic spectra of other classes of graphs.