Enumeration of spanning trees of graph: alternative methods
Summary: Not all the trees of the graph are important, but spanning trees have a special significance in the analysis of networks and systems. The simplest of the prototype methods is based on incidence matrix. Two new approaches are being proposed in this paper, which makes use of few other matrices used to represent the topology of the network graph. Some optimization techniques are also developed to reduce the number of calculations and computer time as well. Comparison is made between prototype and proposed methods using programs developed in \texttt{MATLAB}. The efficiency of the proposed method is proved with a simple case study.
- An algorithm for the enumeration of spanning trees
- New method for counting the number of spanning trees in a two-tree network
- Linear algebraic techniques for spanning tree enumeration
- An iteration method for computing the total number of spanning trees and its applications in graph theory
- Enumeration of spanning trees in planar unclustered networks
- Critical analysis of the spanning tree techniques
- scientific article; zbMATH DE number 1210904 (Why is no real title available?)
- scientific article; zbMATH DE number 1066967 (Why is no real title available?)
- Spanning trees and hierarchical networks
- Faster enumeration of all spanning trees of a directed graph
- scientific article; zbMATH DE number 7771742 (Why is no real title available?)
This page was built for publication: Enumeration of spanning trees of graph: alternative methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431526)
