Is there some sort of formula for trying to find the number of non-isomorphic trees with a fixed amount of vertices? I've been given this problem:

Draw the graphs of all nonisomorphic trees on six vertices.

Question

Is there some sort of formula for trying to find the number of non-isomorphic trees with a fixed amount of vertices? I've been given this problem:

Draw the graphs of all nonisomorphic trees on six vertices.

anonymous · Answer

I've found a helpful explaination from this website: http://math.stackexchange.com/questions/537295/how-to-find-non-isomorphic-trees but I'm not sure as to how they are determining the number of graphs to draw.

anonymous · Answer

I also notice from that example and from a few in my book that the max degrees always seems to be |E|=|V|-1 or one less than the number of vertices that you are given.