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


Top Users Jun 2017
  1. Bikram

    3704 Points

  2. Hemant Parihar

    1484 Points

  3. junaid ahmad

    1432 Points

  4. Arnab Bhadra

    1408 Points

  5. Niraj Singh 2

    1311 Points

  6. Rupendra Choudhary

    1194 Points

  7. rahul sharma 5

    1132 Points

  8. Debashish Deka

    1004 Points

  9. srestha

    932 Points

  10. Arjun

    930 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 19 - 25
  1. Bikram

    1960 Points

  2. Niraj Singh 2

    1306 Points

  3. junaid ahmad

    502 Points

  4. sudsho

    410 Points

  5. akankshadewangan24

    388 Points


23,355 questions
30,066 answers
67,371 comments
28,382 users