Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.


maths123
Posts:
4
From:
uk
Registered:
5/28/11


Graph Theorytrees
Posted:
May 28, 2011 10:03 AM


Problem is: For n greater than or equal to 3, find the number of trees with vertex set {1,2,...,n} with exactly n2 leaves exactly.
I just applied Cayleys theorem there are n^n2 trees on that vertex set because there are n^n2 sequences of length n2 from the vertex set.
I think this is wrong but cant think of another way to do the problem?



