A network of communication towers consists of $V$ towers. Each tower is connected to exactly $k$ other towers. If the total number of distinct communication links is $E = \frac{Vk}{2}$, under what conditions can this graph be decomposed into exactly $k$ spanning trees?