Given $n$ vertices, the question is to answer how many different connected graphs exist?
For example, $f(1)=1,f(2)=1,f(3)=2,f(4)=6 \cdots$.
Here I exclude the isomorphic graphs.
I know there is a sequence http://oeis.org/A001349
But can anyone try to explain how to calculate the sequence?