Magic labelings of triangles

The first proof is given that for every even integer s≥4, the graph consisting of s vertex disjoint copies of C₃, (denoted sC₃) is vertex-magic. Hence it is also edge-magic. It is shown that for each even integer s≥6, sC₃ has vertex-magic total labelings with at least 2s−2 different magic constants. If s≡2mod4, two extra vertex-magic total labelings with the highest possible and lowest possible magic constants are given. If s=2⋅3^k, k≥1, it is shown that sC₃ has a vertex-magic total labeling with magic constant h if and only if (1/2)(15s+4)≤h≤(1/2)(21s+2). It is also shown that 2C₃ is not vertex-magic. If s is odd, vertex-magic total labelings for sC₃ with s+1 different magic constants are provided.