It is known [1]} that regular graphs are antimagic. Hence they are strongly antimagic. Now start with a strongly antimagic labeling of a cycle \(C_n\) , where the vertex, say \(u\) , has the largest \(\phi \) -value. We sequentially attach cycles to \(u\)  to obtain the given cycle spider, which by add a cycles strongly antimagic.
