An (a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers {1,2,3, ...,p + q} such that all the edge-weights w(uv) = f(u) + f(v) + f(uv);uv ε E(G), form an arithmetic progression starting from a and having common difference d. An (a, d)-edge-antimagic total labeling is called a super (a, d)-edge-antimagic total labeling ((a, d)-SEAMT labeling) if f(V(G)) = {l,2,3,...,p}. The graph Fn consisting of n triangles with a common vertex is called the friendship graph. The generalized friendship graph Fm1,m2.....mn consists of n cycles of orders m1 ≤ m2 ≤,...,≤ mn having a common vertex. In this paper we prove that the friendship graph F16 does not admit a (a, 2)-SEAMT labeling. We also investigate the existence of (a, d)-SEAMT labeling for several classes of generalized friendship graphs.