This paper deals with two types of graph labelings, namely, the super \((a, d)\)-edge antimagic total labeling and super \((a, d)\)-vertex antimagic total labeling on the Harary graph \(C_n^t\). We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of \(k\) identical copies of the Harary graph.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.