In this article, we provide a constructive procedure to generate a spanning tree for any graph from its dominating set, γ set. We introduce a new kind of minimum dominating set and hence generate a minimum weighted spanning tree from a γ set for G. We also provide a method for generating a minimum weighted spanning tree using adjacency matrix of G. Key–Words: Spanning tree, Minimum dominating s...

The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem edge costs lie in an interval instead of having a fixed value. Interval numbers model uncertainty about the exact cost values. A robust spanning tree is a spanning tree whose total cost minimizes the maximum deviation fr...