Enumeration of the Edge Weights of Symmetrically Designed Graphs

The idea of super - edge-antimagic labeling of graphs had been introduced by Enomoto et al. in the late nineties. This article addresses super - edge-antimagic labeling of a biparametric family of pancyclic graphs. We also present the aforesaid labeling on the disjoint union of graphs comprising upon copies of and different trees. Several problems shall also be addressed in this article.