Enumeration of the edge weights of symmetrically designed graphs (Q2052124)

Summary: The idea of super \((a, 0)\)-edge-antimagic labeling of graphs had been introduced by \textit{H. Enomoto} et al. [SUT J. Math. 34, No. 2, 105--109 (1998; Zbl 0918.05090)] in the late nineties. This article addresses super \((a, 0)\)-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 \(C_4\) and different trees. Several problems shall also be addressed in this article.