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

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

Can anyone explain it with complete proof?

asked in Programming by Veteran (12.5k points) 10 47 90 | 117 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 (847 points) 1 4 9


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23398 Points

  2. Bikram

    17078 Points

  3. Habibkhan

    8280 Points

  4. srestha

    6300 Points

  5. Debashish Deka

    5438 Points

  6. jothee

    4978 Points

  7. Sachin Mittal 1

    4772 Points

  8. joshi_nitish

    4348 Points

  9. sushmita

    3970 Points

  10. Rishi yadav

    3804 Points


Recent Badges

Commentator Shivam Chauhan
Notable Question set2018
Nice Comment srestha
Notable Question set2018
Regular Shankar Jha
Popular Question Shubhanshu
Good Comment mcjoshi
Notable Question antarachoudhury
Popular Question shweta12345
Good Comment Rohan Mundhey
27,325 questions
35,176 answers
84,122 comments
33,280 users