f.nasim's blog

By f.nasim, 12 years ago, In English
How many different spanning trees are possible in a graph with n vertices? Also explain the calculation.Thanks in advance.
 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

12 years ago, # |
  Vote: I like it 0 Vote: I do not like it
If I'm not mistaken, here is what you need: http://en.wikipedia.org/wiki/Kirchhoff's_theorem .
12 years ago, # |
  Vote: I like it 0 Vote: I do not like it
It depends on what we consider as different tree, i.e. is vertices numbered or not
12 years ago, # |
  Vote: I like it 0 Vote: I do not like it
n^(n-2)