How many different spanning trees are possible in a graph with n vertices? Also explain the calculation.Thanks in advance.
№ | Пользователь | Рейтинг |
---|---|---|
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 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
mmaxio
|
14 лет назад,
#
|
0
If I'm not mistaken, here is what you need: http://en.wikipedia.org/wiki/Kirchhoff's_theorem .
→
Ответить
|
Egor
|
14 лет назад,
#
|
0
It depends on what we consider as different tree, i.e. is vertices numbered or not
→
Ответить
|
f.nasim
|
14 лет назад,
#
^
|
0
Yes, the vertices are numbered,
→
Ответить
|
CherryTree
|
14 лет назад,
#
|
0
n^(n-2)
→
Ответить
|
f.nasim
|
14 лет назад,
#
^
|
0
How come?
→
Ответить
|
fetetriste
|
14 лет назад,
#
^
|
0
This was meant.
→
Ответить
|
Название |
---|