Summary: Motivated by challenges related to domination, connectivity, and information propagation in social and other networks, we initiate the study of the vector connectivity problem. This problem takes as input a graph \(G\) and an integer \(k_v\) for every vertex \(v\) of \(G\), and the objective is to find a vertex subset \(S\) of minimum cardinality such that every vertex \(v\) either belongs to \(S\), or is connected to at least \(k_v\) vertices of \(S\) by disjoint paths. If we require each path to be of length exactly 1, we get the well-known vector domination problem, which is a generalization of the famous dominating set problem and several of its variants. Consequently, our problem becomes NP-hard if an upper bound on the length of the disjoint paths is also supplied as input. Due to the hardness of these domination variants even on restricted graph classes, like split graphs,vector connectivity seems to be a natural problem to study for drawing the boundaries of tractability for this type of problems. We show that vector connectivity can actually be solved in polynomial time on split graphs, in addition to cographs and trees. We also show that the problem can be approximated in polynomial time within a factor of \(\ln\,n+2\) on all \(n\)-vertex graphs.