5,398 views

2 Answers

Best answer
8 votes
8 votes

No of Labelled Trees => nn-2 

https://en.wikipedia.org/wiki/Cayley's_formula

Then set each of tree node to be root, in each tree there are n ways to choose the root

Total No of rooted labeled trees => nn-2 * n => nn-1

Reference Graph Theory, Narsing Deo, Chapter on counting trees.

selected by

Related questions

0 votes
0 votes
1 answer
3
angel rajput asked Feb 15, 2015
733 views
If I have any complete graph given then what is the approach to be followed up for calculating the number of paths of length n because for large value of n ,computation w...
0 votes
0 votes
2 answers
4
yuuchan asked Jul 22, 2023
475 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉