Super edge-antimagic labeling of a cycle with a chord

An (a,d)-edge-antimagic total labeling of G is a one-to-one mapping g taking the vertices and edges onto 1, 2,..., vertical bar V(G)vertical bar + vertical bar E(G)vertical bar so that the edge-weights w(uv) = g(u)+g(v)+g(uv), uv epsilon E(G), form an arithmetic progression with initial term a and common difference d. Such a labeling is called super if the smallest labels appear on the vertices. In this paper, we investigate the existence of super (a, d)-edge-antimagic total labelings of graphs derived from cycles by adding one chord.