A \((p,q)\)-graph \( G \) is called \((a,d)\)-\({edge\; antimagic\; total}\), in short \((a,d)\)-EAMT, if there exist integers \( a > 0 \), \( d \geq 0 \) and a bijection \( \lambda: V \cup E \to \{1, 2, \ldots, p+q\} \) such that \( W = \{w(xy) : xy \in E\} = \{a, a+d, \ldots, a + (q-1)d\} \), where \( w(xy) = \lambda(x) + \lambda(y) + \lambda(xy) \) is the edge-weight of \( xy \). An \((a,d)\)-EAMT labeling \( \lambda \) of \( G \) is \({super}\), in short \((a,d)\)-SEAMT, if \( \lambda(V) = \{1, 2, \ldots, p\} \). In this paper, we propose some theorems on how to construct new (bigger) \((a, d)\)-SEAMT graphs from old (smaller) ones.