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 | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
mmaxio
|
14 years ago,
#
|
0
If I'm not mistaken, here is what you need: http://en.wikipedia.org/wiki/Kirchhoff's_theorem .
→
Reply
|
Egor
|
14 years ago,
#
|
0
It depends on what we consider as different tree, i.e. is vertices numbered or not
→
Reply
|
f.nasim
|
14 years ago,
#
^
|
0
Yes, the vertices are numbered,
→
Reply
|
CherryTree
|
14 years ago,
#
|
0
n^(n-2)
→
Reply
|
f.nasim
|
14 years ago,
#
^
|
0
How come?
→
Reply
|
fetetriste
|
14 years ago,
#
^
|
0
This was meant.
→
Reply
|
Name |
---|