How many different spanning trees are possible in a graph with n vertices? Also explain the calculation.Thanks in advance.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | cry | 161 |
2 | maomao90 | 160 |
3 | awoo | 159 |
4 | atcoder_official | 157 |
5 | -is-this-fft- | 155 |
5 | nor | 155 |
5 | adamant | 155 |
8 | Um_nik | 152 |
8 | maroonrk | 152 |
10 | djm03178 | 146 |
![]() ![]() mmaxio
|
14 years ago,
#
|
![]() ![]() If I'm not mistaken, here is what you need: http://en.wikipedia.org/wiki/Kirchhoff's_theorem .
→
Reply
|
![]() ![]() Egor
|
14 years ago,
#
|
![]() ![]() It depends on what we consider as different tree, i.e. is vertices numbered or not
→
Reply
|
![]() f.nasim
|
14 years ago,
#
^
|
![]() ![]() Yes, the vertices are numbered,
→
Reply
|
![]() CherryTree
|
14 years ago,
#
|
![]() ![]() n^(n-2)
→
Reply
|
![]() f.nasim
|
14 years ago,
#
^
|
![]() ![]() How come?
→
Reply
|
![]() ![]() fetetriste
|
14 years ago,
#
^
|
![]() ![]() This was meant.
→
Reply
|
Name |
---|