Abstract
This paper is aimed to investigate the existence of super (a,d)-C_3- antimagic total labeling of dutch windmill graph D_3^m . 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_3^m, with m>=2 has super (14m+9,5)-C_3- antimagic total labeling, super (13m+8,3)-C_3- antimagic total labeling, super (12m+9.,5)-C_3- antimagic total labeling, super (11m+10.,7)-C_3- antimagic total labeling, super (10m+8.,3)-C_3- antimagic total labeling.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
