Enumeration of spanning trees of graph: alternative methods

Prabhakar Tiwari, Ibraheem and N.K. Sharma

International Journal of Mathematics in Operational Research, 2011, vol. 3, issue 2, 170-185

Abstract: All the trees of the graph are not 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 have been proposed in this paper, which makes use of few other matrices used to represent topology of the network graph. Some optimisation 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 MATLAB. Efficiency of the proposed method is proved with a simple case study.

Keywords: cut set; graph spanning trees; network analysis; tie set; incidence matrix; optimisation; graph theory; electrical networks; distributed networks; communication systems; power systems. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=38909 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:3:y:2011:i:2:p:170-185

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().