Graph

Subgraph

Weighted graph

Degree of valency/order

Path

Walk

Cycle/circuit

Connected

Loop

Simple graph

Digraph/Directed edges

Tree

Spanning tree

Bipartite graph

Complete graph

Complete bipartite graph

Isomorphic graphs

Adjacency matrix

Distance matrix

Early event time

Late event time

Critical activity

Critical path

Total float

Matching

Maximal matching

Complete matching

Alternating path

The purpose of dummies:

Explain why there must always be an even [or zero] number of vertices with odd valency in every graph.

Differences between Kruskal’s and Prim’s Algorithm: