\((a,d)\)-edge-antimagic total labelings of cycle. (Q2918547)

Several types of ``antimagic labelings'' of graphs have been delineated, by many authors. Among these are ``\((a,d)\)-edge-antimagic total labelings'' and ``\((a,d)\)-vertex-antimagic total labelings.'' In this paper, the definition of the latter is unfortunately used as the definition of the former, so some confusion ensues. In the case of cycles, there is a trivial equivalence linking the two notions; the results in this paper imply that if the graph is an even cycle then it has a \((v+4, 4)\)-X-antimagic total labeling, and that no cycle has an \((a, d)\)-X-antimagic total labeling with \(d > 5\), where the ``X'' can be replaced by ``vertex'' or by ``edge.''