\begin{definition}[Definition:Maximum Spanning Tree]
Let $G$ be a weighted graph.
The '''maximum spanning tree''' for $G$ is a spanning tree for $G$ which has a maximum total weight.
For a given $G$, the '''maximum spanning tree''' may not be unique.
It can also be called the '''maximum connector''' for $G$.
Category:Definitions/Graph Theory
\end{definition}