How many different spanning trees are possible in a graph with n vertices? Also explain the calculation.Thanks in advance.
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
|