Degree–Constrained MST Algorithm

This paper shows generation of minimal spanning trees based on two constraints, namely degree constraint and node weightage, of a simple symmetric and connected graph G. A new algorithm is proposed here to find out the minimal spanning tree of graph G based on the average degree sequence factor of the nodes of the graph. The time complexity of the problem is less thanO(N log |E|) compared with the existing algorithms’ time complexity, O(E log |E|)+Cof the Kruskal algorithm, which is optimum. The goal is to design an algorithm that is simple, elegant, efficient, easy to understand and applicable in the field of special areas like constraint-based network design, mobile computing with specific criteria and other special applications in the field of engineering and science.