Generation of Second Best MST Based on Analytical Perspective of Degree Sequence

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|²). 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.