GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
82 views

There are nn-2 labeled trees with n vertices(n>2)

Can anyone explain it with complete proof?

asked in Programming by Veteran (11.4k points)   | 82 views

1 Answer

+1 vote

There are nn-2 labeled tree with n vertices

In a tree with 3 nodes we can have 3 labeled tree

suppose there a three nodes 1,2,3

1-2-3  ,  1-3-2 and 2-1-3

if n=3 we have 33-2=3 labeled trees

In a tree with 4 nodes we can have 16 labeled tree

In a tree with 5 nodes we can have 125 labeled tree

answered by (339 points)  


Top Users Apr 2017
  1. akash.dinkar12

    3660 Points

  2. Divya Bharti

    2580 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Debashish Deka

    1614 Points

  7. Shubham Sharma 2

    1610 Points

  8. Prashant.

    1492 Points

  9. Arjun

    1472 Points

  10. Arunav Khare

    1464 Points

Monthly Topper: Rs. 500 gift card

22,088 questions
28,063 answers
63,298 comments
24,173 users