Abstract
This paper is approaching a new technique of creating Minimal Spanning Trees based on degree constraints of a simple symmetric and connected graph G. Here we recommend a new algorithm based on the average degree sequence factor of the nodes in the graph. The time complexity of the problem is less than
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have