On Super (a, d) -C₃- Antimagic Total Labeling of Dutch Windmill Graph D₃ᵐ

This paper is aimed to investigate the existence of super (a, d) -C₃- antimagic total labeling of dutch windmill graph D₃ᵐ. The methods to achieves the goal was taken in three step. First of all determine the edge and vertices notation on dutch windmill graph. At the second step, labeling the vertices and edges of several dutch windmill graphs, then obtained the pattern. Finally pattern must be proven to become theorem. Based on the study, The Dutch Windmill Graph D₃ᵐ, with m>=2 has super (14m+9, 5) -C₃- antimagic total labeling, super (13m+8, 3) -C₃- antimagic total labeling, super (12m+9. , 5) -C₃- antimagic total labeling, super (11m+10. , 7) -C₃- antimagic total labeling, super (10m+8. , 3) -C₃- antimagic total labeling.