A Classical Approach of MST Generation Based on Weightage

This paper considers generation of Minimal Spanning Trees (MST) of a simple symmetric and connected graph G. In this paper, we propose a new algorithm to find out minimal spanning tree of the graph G based on the weightage of nodes in graph. The time complexity of the problem is in polynomial order with better execution time comparing to the existing algorithms. The goal is to design an algorithm that is simple, elegant, easy to understand and applicable in field of networking design and mobile computing.