The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+1 vote

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

Can anyone explain it with complete proof?

in Programming by Boss (11.1k points) | 190 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

by Active (1.3k points)

Related questions

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
50,092 questions
55,322 answers
86,220 users