Enumeration of spanning trees of graph: alternative methods (Q2431526)

From MaRDI portal
Revision as of 11:58, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Enumeration of spanning trees of graph: alternative methods
scientific article

    Statements

    Enumeration of spanning trees of graph: alternative methods (English)
    0 references
    0 references
    15 April 2011
    0 references
    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.
    0 references
    cut set
    0 references
    graph spanning trees
    0 references
    network analysis
    0 references
    tie set
    0 references
    incidence matrix
    0 references
    optimisation
    0 references
    graph theory
    0 references
    electrical networks
    0 references
    distributed networks
    0 references
    communication systems
    0 references
    power systems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references