This paper deals with two types of graph labelings namely, super \((a, d)\)-edge antimagic total labeling and \((a, d)\)-vertex antimagic total labeling. We provide super \((a, d)\)-edge antimagic total labeling for disjoint unions of Harary graphs and disjoint unions of cycles. We also provide \((a,d)\)-vertex antimagic total labeling for disjoint unions of Harary graphs, disjoint unions of cycles, sun graphs and disjoint unions of sun graphs,
1970-2025 CP (Manitoba, Canada) unless otherwise stated.