Title: Enumeration of spanning trees of graph: alternative methods

Authors: Prabhakar Tiwari, Ibraheem, N.K. Sharma

Addresses: Department of Electrical and Electronics Engineering, Krishna Institute of Engineering and Technology, Muradnagar, Ghaziabad 201206, UP, India. ' Department of Electrical Engineering, Faculty of Engineering and Technology, Jamia Millia Islamia, New Delhi 110025, India. ' Department of Electrical Engineering, RKG Institute of Technology, Ghaziabad, UP 201001, India

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.

DOI: 10.1504/IJMOR.2011.038909

International Journal of Mathematics in Operational Research, 2011 Vol.3 No.2, pp.170 - 185

Available online: 06 Mar 2011

Full-text access for editors Access for subscribers Purchase this article Comment on this article