GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
102 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.7k points)   | 102 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 Junior (627 points)  


Top Users Aug 2017
  1. ABKUNDAN

    4658 Points

  2. Bikram

    4134 Points

  3. akash.dinkar12

    3144 Points

  4. rahul sharma 5

    2928 Points

  5. manu00x

    2682 Points

  6. makhdoom ghaya

    2390 Points

  7. just_bhavana

    2058 Points

  8. Tesla!

    1782 Points

  9. pawan kumarln

    1574 Points

  10. learner_geek

    1558 Points


24,892 questions
31,967 answers
74,213 comments
30,083 users