How many distinct (non-isomorphic) trees can be drawn for a graph of order n?
Graph Theory Question:
I made this up after reading about trees
How many distinct (non-isomorphic) trees can be drawn for a graph of order n?
To find out I made a table and tried to see how many trees I could make...
order# of trees
21
31
42
53
65
76
.
.
..
.
.
Is there a pattern here?
I think my numbers are wrong because I found a paper online that says it's n^(n-2) and that's not what I have... But, I don't think they are dealing with isomorphism the way I am in that paper... I mean, there is only one way to make a tree with three vertices... it's the graph P3, right? help!
I made this up after reading about trees
How many distinct (non-isomorphic) trees can be drawn for a graph of order n?
To find out I made a table and tried to see how many trees I could make...
order# of trees
21
31
42
53
65
76
.
.
..
.
.
Is there a pattern here?
I think my numbers are wrong because I found a paper online that says it's n^(n-2) and that's not what I have... But, I don't think they are dealing with isomorphism the way I am in that paper... I mean, there is only one way to make a tree with three vertices... it's the graph P3, right? help!