Super (a,d)-H-antimagic covering of möbius ladder graph

Abstract

Let G = (V(G), E(G)) be a simple graph. Let H-covering of G is a subgraph H1, H2, …, Hj with every edge in G is contained in at least one graph Hi for 1 ≤ i ≤ j. If every Hi is isomorphic, then G admits an H-covering. Furthermore, an (a,d)-H-antimagic covering if there bijective function . The H−-weights for all subgraphs H− isomorphic to . The weights of subgraphs constitutes an arithmatic progression {a, a + d, …, a + (t − 1)d} where a and d are positive integers and t is the number of subgraphs G isomorphic to H. If then ξ is called super (a, d)-H-antimagic covering. The research provides super (a, d)-H-antimagic covering with d = {1, 3} of Möbius ladder graph Mn for n > 5 and n is odd.