# Question: how many simple connected graphs on n nodes all having...

###### Question details

How many simple connected graphs on 𝑛n nodes, all having degree
2, are there (up to isomorphism)?

Your answer:

How many simple graphs with 2𝑛2n nodes of degree 2 and exactly 2
connected components are there (up to isomorphism)?

Your answer: