Generation of Minimal Spanning Tree Based on Analytical Perspective of Degree Sequence

Abstract

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 minimum spanning tree of the graph G based on the degree sequence factor of nodes in graph. The time complexity of the problem is less than O(N log E ) compared to the existing algorithms time complexity, O(E log E )+ C of 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 networking design, mobile computing and engineering