In this paper we deal with the dynamic connectivity problem, targeting determinis tic worst -case poly-logarithmic time -complexities. First we show that instead of solving the dynamic connectivity problem on a general graph G, it suffices to solve it on a graph we name aligned double-forest that has only 2n-1 edges where n is the number of vertices . Then w e present an algorithm that achieves all the operations in logarithmic worst-case time on a graph we name star-tied forest that consists of a star and a forest (of trees), both defined on the same set of vertices. The star-tied forest which can be seen as a special case of an aligned double -forest is more complicated than a forest on which determinis tic worst -case logarithmic time -complexities have already been obtained by means of the Dynamic Trees algorithm, introduced by Sleator and Tarjan (1983). For implementing the operations we build upon Dynamic Trees.