Enumeration of spanning trees of graph: alternative methods
by Prabhakar Tiwari, Ibraheem, N.K. Sharma
International Journal of Mathematics in Operational Research (IJMOR), Vol. 3, No. 2, 2011

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.

Online publication date: Thu, 12-Feb-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com