When say that with n vertices there are total 2^(n(n-1)/2) connected/disconnected graph possible, in this case we are assuming that vertices are labelled, right??
Is there any formula to count number of connected/disconnected graphs possible with n unlabeled vertices?