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.