DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
http://drsr.daiict.ac.in//handle/123456789/977| Title: | Counting number of minimum spanning trees |
| Authors: | Muthu, Rahul Sompura, Jigar |
| Keywords: | MST(minimum spanning tree) Matrix Tree Theorem Spanning Tree Hamiltonian cycle complete graph Lowest weight edge omponent |
| Issue Date: | 2020 |
| Citation: | Sompura, Jigar (2020). Counting number of minimum spanning trees. Dhirubhai Ambani Institute of Information and Communication Technology. vii, 27 p. (Acc.No: T00915) |
| Abstract: | 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. |
| URI: | http://drsr.daiict.ac.in//handle/123456789/977 |
| Appears in Collections: | M Tech Dissertations |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 201811071.pdf Restricted Access | 722.38 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.