No. Of simple non isomorphic trees are possible with n vertices
Answers
Answered by
0
I have a textbook solution with little to no explanation (this is with n = 5):
Could anyone explain how to "think" when solving this kind of a problem? (for example, drawing all non isomorphic trees with 6 vertices, 7 vertices and so on).
Could anyone explain how to "think" when solving this kind of a problem? (for example, drawing all non isomorphic trees with 6 vertices, 7 vertices and so on).
Similar questions