Let be a connected, simple graph with finite vertices and edges . A family of subgraphs such that for all , , for some is an edge-covering of . If , , then has an -covering. Graph with -covering is an --antimagic if a bijection exists and the sum over all vertex-weights and edge-weights of forms a set . The labeling is super for and graph is -supermagic for . This manuscript proves results about super -antimagic labeling of path amalgamation of ladders and fans for several differences.

中文翻译：

---

路径合并的梯子和风扇的H覆盖

让我们成为一个具有有限顶点和边的连通简单图。一个家庭 这样的子图 ， ，对于一些是的边缘覆盖。如果， ，则有-覆盖。带-的图形是-如果存在双射，并且所有顶点权重和边权重之和形成一个集合。标签超级适合和图是-对于。这份手稿证明有关超结果-梯子和球迷的路径合并的反魔法标记数的差异。