The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » alt.math.undergrad

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Graph Theory-trees
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  

Posts: 4
From: uk
Registered: 5/28/11
Graph Theory-trees
Posted: May 28, 2011 10:03 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Problem is: For n greater than or equal to 3, find the number of trees with vertex set {1,2,...,n} with exactly n-2 leaves exactly.

I just applied Cayleys theorem there are n^n-2 trees on that vertex set because there are n^n-2 sequences of length n-2 from the vertex set.

I think this is wrong but cant think of another way to do the problem?

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.