A graph  admits an -covering if every edge in G belongs to at least one of the subgraphs    If for every i,  is isomorphic to a given graph H, then G is called to have an H-covering. An -H-antimagic total labeling of graph G is a bijection  such that the set of weights of every subgraph  which is isomorphic to H is  where a and d are positive integers, and t is the number of subgraph of G isomorphic to H. If  then G called to have a super -H-antimagic total labeling. This project applies this labeling to the ladder graph  with cover  that is,    and  for some value of d is possible.

covering, total labeling, -H-antimagic total labeling, super -H-antimagic total labeling, ladder graph