Study on the Method of Spanning Connected Graph All Trees Based on Ameliorative Wang-Algebra
Lijun Tang, Luo Ri-cheng, Hongguang Xiao, Deng Min, Juan Su · Natural Science Journal of Xiangtan University · 2005
How to count all spanning trees of topologic graph is important in graph theory. Amethod to generate all spanning trees of graph is presented in the paper,the method need not ring-sum-operation during generating all spanning trees of graph by ameliorating Wang-algebra,accordingly,it can reduce the time complexity of algorithm;at the same time,the method can generate all trees of graph and assures that the same tree will not repeated generate,comparing with the Wang-algebra method,the method get over the question of computing the cancelled terms when generating all trees.The example makes clear that this method is validity and feasibility,it can be effectively used to topologic analysis of complex electric networks.