mgf1107lecture20

# mgf1107lecture20 - MGF 1107 EXPLORATIONS IN MATHEMATICS...

This preview shows pages 1–3. Sign up to view the full content.

MGF 1107 – EXPLORATIONS IN MATHEMATICS LECTURE 20 Spanning Trees In the previous lecture we looked at the definition of a tree in graph theory, and the properties that they have. A more realistic problem though is how to create trees from connected graphs that are initially not trees, and in particular how to create one that minimizes cost or distance. Definition: Given any network, the number of redundant edges is equal to M – (N – 1), where M is the number of edges, and N is the number of vertices. Definition: A spanning tree of a graph G is a selection of edges that form a tree and include every vertex. Note: In order to create a spanning tree we must remove a number of edges equal to the redundancy of the original network. Ex.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
The problems become more interesting when we have a preference for one spanning tree over another based on cost or distance due to the weighting of the edges Definition: A minimum spanning tree (MST) is a a spanning tree with weight less than or equal to the weight of every other spanning tree. Ex.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 09/22/2011 for the course MAC 2311 taught by Professor Evinson during the Spring '08 term at University of Central Florida.

### Page1 / 5

mgf1107lecture20 - MGF 1107 EXPLORATIONS IN MATHEMATICS...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online