Definition:Maximum Spanning Tree

From ProofWiki
Jump to navigation Jump to search

Definition

Let $G$ be a weighted graph.

A maximum spanning tree for $G$ is a spanning tree for $G$ which has a maximum total weight.


Also known as

A maximum spanning tree can also be called the maximum connector for $G$.


Also see