International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 73 - Number 19 |
Year of Publication: 2013 |
Authors: Adarsh Kumar Verma, Saurabh Sharma, Anuj Tiwari |
10.5120/12994-0250 |
Adarsh Kumar Verma, Saurabh Sharma, Anuj Tiwari . A Study on ‘Number of Spanning Trees’. International Journal of Computer Applications. 73, 19 ( July 2013), 27-31. DOI=10.5120/12994-0250
There exist many algorithms for producing the spanning trees of a graph with better time and space complexities. In this research study, we are presenting a study on number of spanning trees and a technique based on the basic cycle to find the number of spanning trees and also the structure of all the spanning trees of a labeled and undirected graph.