A graph $G(V,E)$ has a $mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isomorphic to $mathcal{H}$. An $(a,d)$-$mathcal{H}$-antimagic total covering is a total labeling $lambda$ from $V(G)cup E(G)$ onto the integers ${1,2,3,...,|V(G)cup E(G)|}$ with the property that, for every subgraph $A$ of $G$ isomorphic to $mathcal{H}$ the $sum{A}=sum_{vin{V(A)}}lambda{(v)}+sum_{ein{E(A)}}lambda{(e)}$ forms an arithmetic sequence. A graph that admits such a labeling is called an $(a,d)$-$mathcal{H}$-antimagic total covering. Inaddition, if ${lambda{(v)}}_{vin{V}}={1,...,|V|}$, then thegraph is called $mathcal{H}$-super antimagic graph. In this paperwe study of Shackle of Semi {it Windmill}
Copyrights © 2014