Counting number of minimum spanning trees
The problem discussed in this thesis is "To find all k instances for given n, where 1 k nn��2, n is number of vertices and k is number of minimum weight spanning trees by any weight assignments to the edges of a complete graph on n vertices)." In this thesis, we discuss different sides to this problem and different approaches to find values of k. We have given some results based on these approaches, which may be helpful in future work for this problem. This thesis discusses the current work done on this problem and a possible way to advance the solution to this problem.
- M Tech Dissertations