Enumeration of spanning trees of graph: alternative methods. (7th March 2011)

• Record Type: Journal Article
• Authors: Tiwari, Prabhakar; Ibraheem, ; Sharma, N.K.
• Is Part Of: International journal of mathematics in operational research. Volume 3:Number 2(2011)
• Page Start: 170
• Page End: 185
• Publication Date: 2011-03-07
• Subjects: cut-set -- graph -- network analysis -- spanning tree -- tie-set; Operations research -- Mathematical models -- Periodicals; Operations research -- Mathematics -- Periodicals; Decision making -- Mathematical models -- Periodicals; 658.4033
• Languages: English
• ISSNs: 1757-5850

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.