How many different spanning trees are possible in a graph with n vertices? Also explain the calculation.Thanks in advance.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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 |
---|