Drexel dragonThe Math ForumDonate to the Math Forum


Math Forum
 Ask Dr. Math
 Discussions
 Internet Newsletter
 MathTools
 Problems of the Week
 Teacher2Teacher
 Teacher Exchange
 Workshops

Search All of the Math Forum:
Browse our Internet Mathematics Library

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


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

Topic: Graph Theory-trees
Replies: 0  

Advanced Search
Reply to this Topic Reply to this Topic

Back to Topic List Back to Topic List  
maths123

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]

© Drexel University 1994-2015. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.