Networks, paths and trees
Define and interpret network diagrams, find minimum spanning trees and shortest paths.
Discrete Mathematics · MST-11-07
Sub-topics
Network concepts
Identify vertices, edges and vertex degrees in a network; classify networks as connected or disconnected; apply the handshaking lemma and distinguish between paths and walks.
Shortest paths and spanning trees
Identify trees and spanning trees in a network; find the minimum spanning tree and the shortest path between two vertices and explain why these may differ.