We introduce the concept of the minimum basis graph for a weighted matroid. a natural generalization of the minimum spanning tree graph for a weighted graph

and prove that such a graph is again a matroid basis graph. Therefore. it has many satisfactory properties. for example

it is a pancyclic graph and its connectivity equals its minimum degree. On the other hand

we generalize some previous results for weighted graphs to those for weighted matroids.