Counting number of minimum spanning trees

Please use this identifier to cite or link to this item: http://drsr.daiict.ac.in//handle/123456789/977

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Muthu, Rahul
dc.contributor.author	Sompura, Jigar
dc.date.accessioned	2020-09-22T14:37:02Z
dc.date.available	2023-02-17T14:37:02Z
dc.date.issued	2020
dc.identifier.citation	Sompura, Jigar (2020). Counting number of minimum spanning trees. Dhirubhai Ambani Institute of Information and Communication Technology. vii, 27 p. (Acc.No: T00915)
dc.identifier.uri	http://drsr.daiict.ac.in//handle/123456789/977
dc.description.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.
dc.subject	MST(minimum spanning tree)
dc.subject	Matrix Tree Theorem
dc.subject	Spanning Tree
dc.subject	Hamiltonian cycle
dc.subject	complete graph
dc.subject	Lowest weight edge omponent
dc.classification.ddc	530 SOM
dc.title	Counting number of minimum spanning trees
dc.type	Dissertation
dc.degree	M. Tech
dc.student.id	201811071
dc.accession.number	T00915
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

DSpace JSPUI