Abstract-Exhaustive enumeration of spanning trees in a graph requires substantial time and computational overheads. The proposed method, using the concept of LOOP DOMAIN, greatly reduces the complexity of enumeration. The initial graph is transformed into a graph in loop domain where the spanning tree enumeration is then carried out. Subsequently spanning trees of initial graph are generated. The proposed method eliminates all the two degree vertices in a graph. This finds application in power system distribution networks, which have substantial number of two degree vertices. The consequent reduction in size of graph and its corresponding trees is highly desirable. The proposed method is demonstrated on a 33 vertex system and reduction incomplexity is evaluated.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.