In graph theory, what does a "minimum spanning tree" refer to?
a. A tree that includes all the vertices of a graph and has the minimum possible number of edges
b. A subset of edges in a graph that connects all the vertices with the minimum total edge weight
c. A tree that spans the maximum number of edges without creating cycles
d. A spanning tree that has the maximum possible total edge weight