1Department of Computer Science and Applications, NSHM College of Management and Technology, 124, BL Saha Road, Kolkata-700053, West Bengal
2Department of Computer Science & Engineering, University of Calcutta, Senate House, 87/1 College Street, Kolkata- 700073, West Bengal
*E-mail: sarbojay@gmail.com
Online published on 10 August, 2015.
This paper considers generation of second best Minimal Spanning Trees (MST) of a simple symmetric and connected graph G. In this paper, we generate minimum spanning tree of the graph G based on the degree sequence factor of nodes and also generate second best MST based. The time complexity of the algorithm is O (|V|2). The goal is to design an algorithm that is simple, elegant, efficient, easy to implement and applicable in the field of networking design, mobile computing and others field of science and engineering.
Graph, tree, degree factor, MST, second best MST
